66982940131072 + 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:66982940131072 + 1
Verification status (*):Proven
Official Comment (*):Generalized Fermat
Proof-code(s): (*):L4249 : Larsson, GFNSvCUDA, GeneFer, AthGFNSieve, PrimeGrid, LLR
Decimal Digits:1025765   (log10 is 1025764.78035339)
Rank (*):522 (digit rank is 1)
Entrance Rank (*):391
Currently on list? (*):short
Submitted:1/20/2020 20:36:33 CDT
Last modified:1/21/2020 03:20:20 CDT
Database id:130271
Status Flags:TrialDiv
Score (*):46.711 (normalized score 11.7052)

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.
Generalized Fermat (archivable *)
Prime on list: no, rank 137
Subcategory: "Generalized Fermat"
(archival tag id 223678, tag last modified 2020-11-24 19:20:22)

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_id130271
person_id9
machineUsing: Xeon 4c+4c 3.5GHz
whatprime
notesCommand: /home/caldwell/client/pfgw/pfgw64 -t -q"66982940^131072+1" 2>&1 PFGW Version 4.0.1.64BIT.20191203.x86_Dev [GWNUM 29.8] Primality testing 66982940^131072+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 64.32% 66982940^131072+1 is prime! (22502.0476s+0.0336s) [Elapsed time: 6.25 hours]
modified2020-07-07 17:30:10
created2020-01-20 20:41:01
id175957

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