1128330746865 · 266439 - 1
|Description:||1128330746865 · 266439 - 1|
|Verification status (*):||Proven|
|Official Comment (*):||Cunningham chain (p)|
|Proof-code(s): (*):||p158 : Paridon, NewPGen, OpenPFGW|
|Decimal Digits:||20013 (log10 is 20012.184318342)|
|Rank (*):||68344 (digit rank is 4)|
|Entrance Rank (*):||66125|
|Currently on list? (*):||short|
|Submitted:||2/18/2020 10:49:31 CDT|
|Last modified:||2/18/2020 11:20:22 CDT|
|Score (*):||34.5881 (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 130564 person_id 9 machine Using: Xeon 4c+4c 3.5GHz what prime notes Command: /home/caldwell/client/llr.pl 1128330746865*2^66439-1 2>&1 Starting Lucas Lehmer Riesel prime test of 1128330746865*2^66439-1 Using zero-padded AVX FFT length 8K, Pass1=128, Pass2=64 V1 = 11 ; Computing U0... V1 = 11 ; Computing U0...done.Starting Lucas-Lehmer loop... 1128330746865*2^66439-1 is prime! (20013 decimal digits) Time : 2.773 sec. [Elapsed time: 3.00 seconds] modified 2020-07-07 17:30:10 created 2020-02-18 10:51:07 id 176252
Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.