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:||2 · 36225 + 1|
|Verification status (*):||Proven|
|Official Comment:||Divides Phi(3^6223,2) [K]|
|Proof-code(s): (*):||C : Caldwell, Cruncher|
|Decimal Digits:||2971 (log10 is 2970.38084062556)|
|Rank (*):||88751 (digit rank is 11)|
|Entrance Rank (*):||579|
|Currently on list? (*):||no|
|Score (*):||28.6696 (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
- Divides Phi (archivable *)
- Prime on list: no, rank 163
Subcategory: "Divides Phi"
(archival tag id 175455, tag last modified 2019-01-28 19:20:22)
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||Linux PII 200|
|notes||PFGW Version 1.1 for Pentium and compatibles Running N-1 test using base 3 Primality testing 2*3^6225+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Running N-1 test using base 11 Calling Brillhart-Lehmer-Selfridge with factored part 99.99% 2*3^6225+1 is prime! (52.770000 seconds) |
Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.