2378282179665 · 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.

Description:2378282179665 · 21290000 - 1
Verification status (*):Proven
Official Comment (*):[none]
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):L3602 : Shimizu, TwinGen, PrimeGrid, LLR
Decimal Digits:388342   (log10 is 388341.07066992)
Rank (*):10379 (digit rank is 1145)
Entrance Rank (*):3334
Currently on list? (*):no
Submitted:11/27/2015 09:51:20 CDT
Last modified:11/27/2015 10:50:35 CDT
Removed (*):12/1/2016 04:03:19 CDT
Database id:120682
Status Flags:TrialDiv
Score (*):43.7286 (normalized score 0.5288)

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.

Serge Batalov writes (31 Jan 2016):  (report abuse)
Arithmetic progression (2,d=221561854755*2^1290002) [L3494]

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.
machineUsing: Xeon 4c+4c 3.5GHz
notesCommand: /home/caldwell/client/llr.pl 2378282179665*2^1290000-1 2>&1 Starting Lucas Lehmer Riesel prime test of 2378282179665*2^1290000-1 Using zero-padded AVX FFT length 128K, Pass1=128, Pass2=1K V1 = 21 ; Computing U0... V1 = 21 ; Computing U0...done.Starting Lucas-Lehmer loop... 2378282179665*2^1290000-1 is prime! (388342 decimal digits) Time : 775.352 sec. [Elapsed time: 12.93 minutes]
modified2020-07-07 17:30:17
created2015-11-27 10:14:00

Query times: 0.0004 seconds to select prime, 0.0011 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.