9 · 24842 + 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:||9 · 24842 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat; divides GF(4838,3) [BR]|
|Proof-code(s): (*):||K : Keller|
|Decimal Digits:||1459 (log10 is 1458.5414815144)|
|Rank (*):||106030 (digit rank is 7)|
|Entrance Rank (*):||48|
|Currently on list? (*):||no|
|Last modified:||8/30/2007 13:37:52 CDT|
|Score (*):||26.4519 (normalized score 0)|
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 6580
Subcategory: "Generalized Fermat"
(archival tag id 208773, tag last modified 2022-07-03 08:50:16)
- Generalized Fermat Divisors (bases 3,5,6,10,12) (archivable *)
- Prime on list: no, rank 89, weight 28.649133269726
Subcategory: "Divides GF(*,3)"
(archival tag id 185842, tag last modified 2021-02-26 11:20:20)
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 39625 person_id 9 machine Linux PII 200 what prime notes PFGW Version 1.1 for Pentium and compatibles Running N-1 test using base 5 Primality testing 9*2^4842+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 99.94% 9*2^4842+1 is prime! (2.050000 seconds) modified 2003-03-25 11:27:14 created 2002-12-05 22:57:30 id 18925