9 · 1011143 - 1
|Description:||9 · 1011143 - 1|
|Verification status (*):||Proven|
|Official Comment (*):||Near-repdigit|
|Proof-code(s): (*):||D : Dubner, Cruncher|
|Decimal Digits:||11144 (log10 is 11143.954242509)|
|Rank (*):||77043 (digit rank is 1)|
|Entrance Rank (*):||49|
|Currently on list? (*):||no|
|Score (*):||32.7757 (normalized score 0)|
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.
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 16858 person_id 9 machine Windows XP P4 1.8GHz what prime notes Primality testing 9*10^11143-1 [N+1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 69.89% 9*10^11143-1 is prime! (113.623000 seconds) PFGW Version 1.1 for Windows Running N+1 test using discriminant 11, base 1+sqrt(11) modified 2003-03-25 11:25:25 created 2002-12-09 21:10:37 id 35553
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.