572912625477 · 21290000 - 1

At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly.  This list is the most important PrimePages database: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.

This prime's information:

Description:572912625477 · 21290000 - 1
Verification status (*):Proven
Official Comment (*):[none]
Proof-code(s): (*):L3274 : Schouten, TwinGen, PrimeGrid, LLR
Decimal Digits:388341   (log10 is 388340.45249493)
Rank (*):17147 (digit rank is 1218)
Entrance Rank (*):1217
Currently on list? (*):no
Submitted:4/26/2013 23:08:49 UTC
Last modified:3/11/2023 15:54:10 UTC
Removed (*):1/5/2016 12:49:01 UTC
Database id:113971
Status Flags:none
Score (*):43.7286 (normalized score 0.2923)

Verification data:

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.
fieldvalue
prime_id113971
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 572912625477 2 1290000 -1 2>&1 [Elapsed time: 10.343 seconds]
modified2020-07-07 22:30:19
created2013-04-26 23:18:01
id158301

fieldvalue
prime_id113971
person_id9
machineDitto P4 P4
whatprime
notesCommand: /home/ditto/client/llr.pl 572912625477*2^1290000-1 2>&1 Starting Lucas Lehmer Riesel prime test of 572912625477*2^1290000-1 Using Zero Padded IBDWT : Mersenne fftlen = 65536, Used fftlen = 131072 V1 = 5 ; Computing U0... V1 = 5 ; Computing U0...done. Starting Lucas-Lehmer loop... 572912625477*2^1290000-1 is prime! Time : 5581.642 sec. [Elapsed time: 1.55 hours]
modified2020-07-07 22:30:19
created2013-04-26 23:38:01
id158302

Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.