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:||249207 - 224604 + 1|
|Verification status (*):||Proven|
|Official Comment:||Gaussian Mersenne norm 29|
|Proof-code(s): (*):||x16 : Doumen, Beelen, Unknown|
|Decimal Digits:||14813 (log10 is 14812.7829966375)|
|Rank (*):||68663 (digit rank is 2)|
|Entrance Rank (*):||4042|
|Currently on list? (*):||short|
|Submitted:||7/4/2000 04:29:36 CDT|
|Last modified:||7/4/2000 04:29:36 CDT|
|Score (*):||33.6572 (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
- Gaussian Mersenne norm (archivable *)
- Prime on list: yes, rank 12
Subcategory: "Gaussian Mersenne norm"
(archival tag id 192547, tag last modified 2014-09-06 19:20:24)
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 Athlon 1.3GHz|
|notes||PFGW Version 20021217.Win_Dev (Beta 'caveat utilitor') [FFT v22.7 w/P4] Running N-1 test using base 3 Primality testing 2^49207-2^24604+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 50.00% 2^49207-2^24604+1 is prime! (66.145000 seconds) |
Query times: 0.0004 seconds to select prime, 0.0009 seconds to seek comments.