This site will be down for maintenance beginning noon CDT (5pm UTC) Wed April 14
251749 · 22013995 - 1
|Description:||251749 · 22013995 - 1|
|Verification status (*):||Proven|
|Official Comment (*):||Woodall|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||L436 : Andersen2, Gcwsieve, MultiSieve, PrimeGrid, LLR|
|Decimal Digits:||606279 (log10 is 606278.30708504)|
|Rank (*):||2398 (digit rank is 1)|
|Entrance Rank (*):||37|
|Currently on list? (*):||short|
|Submitted:||8/9/2007 05:47:56 CDT|
|Last modified:||8/9/2007 13:27:16 CDT|
|Score (*):||45.097 (normalized score 2.0779)|
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 81907 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 251749 2 2013995 -1 2>&1 [Elapsed time: 10.581 seconds] modified 2020-07-07 17:30:41 created 2007-08-09 05:52:02 id 92932
field value prime_id 81907 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/llr.pl 251749*2^2013995-1 2>&1 Starting Lucas Lehmer Riesel prime test of 251749*2^2013995-1 V1 = 4 ; Computing U0... Done Computing U0. Starting Lucas-Lehmer loop... 251749*2^2013995-1 is prime! Time : 23467.975 sec. [Elapsed time: 6.51888888888889 hours] modified 2020-07-07 17:30:41 created 2007-08-09 05:53:02 id 92933
Query times: 0.0018 seconds to select prime, 0.0007 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.