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 · 3152529 + 1|
|Verification status (*):||Proven|
|Official Comment:||Divides Phi(3^152528,2)|
|Proof-code(s): (*):||gb : Buechel, Keller, Proth.exe|
|Decimal Digits:||72776 (log10 is 72775.128891131)|
|Rank (*):||47991 (digit rank is 1)|
|Entrance Rank (*):||46|
|Currently on list? (*):||no|
|Submitted:||5/13/2000 12:11:43 CDT|
|Last modified:||5/13/2000 12:11:43 CDT|
|Score (*):||38.5748 (normalized score 0.0036)|
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 86
Subcategory: "Divides Phi"
(archival tag id 188617, tag last modified 2020-05-22 18:20:06)
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||WinXP P4 1.8GHz|
|notes||PFGW Version 20021217.Win_Dev (Beta 'caveat utilitor') [FFT v22.7 w/P4] Running N-1 test using base 3 Primality testing 2*3^152529+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 2*3^152529+1 is prime! (1059.973000 seconds) |
Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.