10941 · 210601 - 1
At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important PrimePages database: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.
This prime's information:
| Description: | 10941 · 210601 - 1 |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | Twin (p) |
| Proof-code(s): (*): | g27 : Hanson, Proth.exe |
| Decimal Digits: | 3196 (log10 is 3195.2580410519) |
| Rank (*): | 95622 (digit rank is 2) |
| Entrance Rank (*): | 9203 |
| Currently on list? (*): | no |
| Submitted: | 9/2/1998 23:32:56 UTC |
| Last modified: | 3/11/2023 15:54:10 UTC |
| Database id: | 29272 |
| Status Flags: | none |
| Score (*): | 28.8968 (normalized score 0) |
Archival tags:
There are certain forms classed as archivable: these prime may (at times) remain on this list even if they do not make the Top 5000 proper. Such primes are tracked with archival tags.
- Twin Primes (archivable *)
- Prime on list: no, rank 157
Subcategory: "Twin (p)"
(archival tag id 175305, tag last modified 2024-03-29 23:37:14)
Verification data:
The Top 5000 Primes is a list for proven primes only. In order to maintain the integrity of this list, we seek to verify the primality of all submissions. We are currently unable to check all proofs (ECPP, KP, ...), but we will at least trial divide and PRP check every entry before it is included in the list.
field value prime_id 29272 person_id 9 machine Windows XP P4 1.8GHz what prime notes Primality testing 10941*2^10601-1 [N+1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 99.88% 10941*2^10601-1 is prime! (3.062000 seconds) PFGW Version 1.1 for Windows Running N+1 test using discriminant 13, base 1+sqrt(13) modified 2003-03-25 17:25:49 created 2002-12-09 06:13:55 id 32083
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.