20968936131072 + 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:||20968936131072 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||L4245 : Greer, GFNSvCUDA, GeneFer, AthGFNSieve, PrimeGrid, LLR|
|Decimal Digits:||959654 (log10 is 959653.66113703)|
|Rank (*):||2328 (digit rank is 1)|
|Entrance Rank (*):||797|
|Currently on list? (*):||short|
|Submitted:||9/18/2020 13:26:18 UTC|
|Last modified:||5/20/2023 20:59:19 UTC|
|Score (*):||46.5066 (normalized score 5.5879)|
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 851
Subcategory: "Generalized Fermat"
(archival tag id 225663, tag last modified 2023-05-26 19:37:15)
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.
field value prime_id 131251 person_id 9 machine Using: Xeon (pool) 4c+4c 3.5GHz what prime notes Command: /home/caldwell/clientpool/1/pfgw64 -t -q"20968936^131072+1" 2>&1 PFGW Version 220.127.116.11BIT.20191203.x86_Dev [GWNUM 29.8] Primality testing 20968936^131072+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 66.25% 20968936^131072+1 is prime! (19477.2095s+0.0292s) [Elapsed time: 5.41 hours] modified 2021-04-20 22:39:26 created 2020-09-18 13:31:01 id 176939
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.