At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important databases at The Prime Pages: 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:||64024604131072 + 1|
|Verification status (*):||Proven|
|Official Comment:||Generalized Fermat|
|Proof-code(s): (*):||L4591 : Schwieger, GFNSvCUDA, GeneFer, AthGFNSieve, PrimeGrid, LLR|
|Decimal Digits:||1023194 (log10 is 1023193.50100582)|
|Rank (*):||468 (digit rank is 1)|
|Entrance Rank (*):||383|
|Currently on list? (*):||short|
|Submitted:||11/2/2019 06:03:04 CDT|
|Last modified:||11/2/2019 12:50:17 CDT|
|Score (*):||46.7033 (normalized score 12.6467)|
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
- Generalized Fermat (archivable *)
- Prime on list: no, rank 105
Subcategory: "Generalized Fermat"
(archival tag id 223601, tag last modified 2020-04-01 06:20:11)
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.
|machine||Using: Xeon 4c+4c 3.5GHz|
|notes||Command: /home/caldwell/client/pfgw/pfgw64 -t -q"64024604^131072+1" 2>&1|
PFGW Version 126.96.36.199BIT.20130722.x86_Dev [GWNUM 27.11]
Primality testing 64024604^131072+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Calling Brillhart-Lehmer-Selfridge with factored part 37.17%
64024604^131072+1 is prime! (23001.5991s+0.0324s)
[Elapsed time: 6.39 hours]
Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.