963720102345 · 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:963720102345 · 21290000 - 1
Verification status (*):Proven
Official Comment (*):Arithmetic progression (2,d=175578398085*2^1290001) [p199]
Proof-code(s): (*):L3550 : Ready, TwinGen, PrimeGrid, LLR
Decimal Digits:388341   (log10 is 388340.67835745)
Rank (*):11644 (digit rank is 877)
Entrance Rank (*):1415
Currently on list? (*):no
Submitted:10/3/2013 22:25:36 CDT
Last modified:10/1/2015 20:25:34 CDT
Database id:115798
Status Flags:TrialDiv
Score (*):43.7286 (normalized score 0.5233)

Archival tags:

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.
Arithmetic Progressions of Primes (archivable class *)
Prime on list: no, rank 10
Subcategory: "Arithmetic progression (2,d=*)"
(archival tag id 218093, tag last modified 2020-04-08 13:50:11)

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.
machineRedHat P4 P4
notesCommand: /home/caldwell/client/llr.pl 963720102345*2^1290000-1 2>&1 Starting Lucas Lehmer Riesel prime test of 963720102345*2^1290000-1 Using Zero Padded IBDWT : Mersenne fftlen = 65536, Used fftlen = 131072 V1 = 17 ; Computing U0... V1 = 17 ; Computing U0...done. Starting Lucas-Lehmer loop... 963720102345*2^1290000-1 is prime! Time : 5510.985 sec. [Elapsed time: 1.53 hours]
modified2020-07-07 17:30:18
created2013-10-04 05:47:29

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