3939880182405 · 2666667 - 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:3939880182405 · 2666667 - 1
Verification status (*):Proven
Official Comment (*):[none]
Proof-code(s): (*):L1126 : Morris, TwinGen, PrimeGrid, LLR
Decimal Digits:200700   (log10 is 200699.35960233)
Rank (*):33478 (digit rank is 1997)
Entrance Rank (*):2134
Currently on list? (*):no
Submitted:9/7/2010 20:40:21 UTC
Last modified:3/11/2023 15:54:10 UTC
Removed (*):7/10/2011 14:55:48 UTC
Database id:94545
Status Flags:none
Score (*):41.699 (normalized score 0.0376)

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_id94545
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 3939880182405 2 666667 -1 2>&1 [Elapsed time: 10.095 seconds]
modified2020-07-07 22:30:33
created2010-09-07 20:48:22
id118461

fieldvalue
prime_id94545
person_id9
machineRedHat P4 P4
whatprime
notesCommand: /home/caldwell/client/llr.pl 3939880182405*2^666667-1 2>&1 Starting Lucas Lehmer Riesel prime test of 3939880182405*2^666667-1 Using Zero Padded IBDWT : Mersenne fftlen = 32768, Used fftlen = 65536 V1 = 5 ; Computing U0... V1 = 5 ; Computing U0...done. Starting Lucas-Lehmer loop... 3939880182405*2^666667-1 is prime! Time : 1439.067 sec. [Elapsed time: 23.98 minutes]
modified2020-07-07 22:30:33
created2010-09-08 14:41:17
id118562

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