387306335355 · 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:387306335355 · 21290000 - 1
Verification status (*):Proven
Official Comment (*):[none]
Proof-code(s): (*):L975 : Hnizdil, TwinGen, PrimeGrid, LLR
Decimal Digits:388341   (log10 is 388340.28246114)
Rank (*):17370 (digit rank is 1397)
Entrance Rank (*):1028
Currently on list? (*):no
Submitted:2/15/2013 23:20:25 UTC
Last modified:3/11/2023 15:54:10 UTC
Removed (*):11/19/2015 10:08:48 UTC
Database id:111240
Status Flags:none
Score (*):43.7286 (normalized score 0.2897)

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_id111240
person_id9
machineDitto P4 P4
whattrial_divided
notesCommand: /home/ditto/client/TrialDiv/TrialDiv -q 387306335355 2 1290000 -1 2>&1 [Elapsed time: 10.797 seconds]
modified2020-07-07 22:30:23
created2013-02-15 23:35:02
id152751

fieldvalue
prime_id111240
person_id9
machineRedHat P4 P4
whatprime
notesCommand: /home/caldwell/client/llr.pl 387306335355*2^1290000-1 2>&1 Starting Lucas Lehmer Riesel prime test of 387306335355*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... 387306335355*2^1290000-1 is prime! Time : 5906.493 sec. [Elapsed time: 1.64 hours]
modified2020-07-07 22:30:23
created2013-02-16 03:06:54
id152758

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