This site will be down for maintenance beginning noon CDT (5pm UTC) Wed April 14
9606632571 · 2151515 - 1
|Description:||9606632571 · 2151515 - 1|
|Verification status (*):||Proven|
|Official Comment (*):||Twin (p)|
|Proof-code(s): (*):||p282 : Rajala, NewPGen, OpenPFGW|
|Decimal Digits:||45621 (log10 is 45620.542364209)|
|Rank (*):||57101 (digit rank is 3)|
|Entrance Rank (*):||47665|
|Currently on list? (*):||short|
|Submitted:||7/16/2014 12:25:19 CDT|
|Last modified:||7/16/2014 12:51:41 CDT|
|Score (*):||37.1341 (normalized score 0.0007)|
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 118184 person_id 9 machine Xeon 4c+4c 3.5GHz what prime notes Command: /home/caldwell/client/llr.pl 9606632571*2^151515-1 2>&1 Starting Lucas Lehmer Riesel prime test of 9606632571*2^151515-1 Using zero-padded AVX FFT length 16K, Pass1=256, Pass2=64 V1 = 3 ; Computing U0... V1 = 3 ; Computing U0...done.Starting Lucas-Lehmer loop... 9606632571*2^151515-1 is prime! (45621 decimal digits) Time : 11.035 sec. [Elapsed time: 11.00 seconds] modified 2020-07-07 17:30:17 created 2014-07-16 12:31:22 id 163748
Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.