65305572131072 + 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:65305572131072 + 1
Verification status (*):Proven
Official Comment (*):Generalized Fermat
Proof-code(s): (*):L5001 : Mamonov, GFNSvCUDA, GeneFer, AthGFNSieve, PrimeGrid, LLR
Decimal Digits:1024322   (log10 is 1024321.157558)
Rank (*):1229 (digit rank is 1)
Entrance Rank (*):388
Currently on list? (*):short
Submitted:12/1/2019 14:27:54 CDT
Last modified:12/1/2019 21:20:23 CDT
Database id:130150
Status Flags:TrialDiv
Score (*):46.7067 (normalized score 7.5685)

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 389
Subcategory: "Generalized Fermat"
(archival tag id 223632, tag last modified 2022-12-31 12:37:12)

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/pfgw/pfgw64 -t -q"65305572^131072+1" 2>&1 PFGW Version [GWNUM 27.11] Primality testing 65305572^131072+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Calling Brillhart-Lehmer-Selfridge with factored part 54.26% 65305572^131072+1 is prime! (22991.2695s+0.0323s) [Elapsed time: 6.39 hours]
modified2020-07-07 17:30:10
created2019-12-01 14:31:01

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