2740879 · 213704395 - 1
|Description:||2740879 · 213704395 - 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Woodall|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||L4976 : Propper, Batalov, Gcwsieve, LLR|
|Decimal Digits:||4125441 (log10 is 4125440.4053173)|
|Rank (*):||29 (digit rank is 1)|
|Entrance Rank (*):||20|
|Currently on list? (*):||short|
|Submitted:||10/26/2019 03:43:23 CDT|
|Last modified:||10/27/2019 12:20:20 CDT|
|Score (*):||50.9768 (normalized score 726.7795)|
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.
User comments about this prime (disclaimer):
User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.
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 130058 person_id 9 machine Using: Xeon 4c+4c 3.5GHz what prime notes Command: /home/caldwell/client/llr.pl 2740879*2^13704395-1 2>&1 Starting Lucas Lehmer Riesel prime test of 2740879*2^13704395-1 Using zero-padded AVX FFT length 1440K, Pass1=384, Pass2=3840 V1 = 4 ; Computing U0... V1 = 4 ; Computing U0...done.Starting Lucas-Lehmer loop... 2740879*2^13704395-1 is prime! (4125441 decimal digits) Time : 115518.337 sec. [Elapsed time: 32.09 hours] modified 2020-07-07 17:30:10 created 2019-10-26 03:51:02 id 175743
Query times: 0.0004 seconds to select prime, 0.0008 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.