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:||9 · 25642513 + 1|
|Verification status (*):||Proven|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||L3432 : Batalov, Srsieve, LLR|
|Decimal Digits:||1698567 (log10 is 1698566.61816647)|
|Rank (*):||78 (digit rank is 1)|
|Entrance Rank (*):||28|
|Currently on list? (*):||short|
|Submitted:||11/29/2013 01:25:01 CDT|
|Last modified:||11/29/2013 22:20:57 CDT|
|Score (*):||48.2579 (normalized score 80.0854)|
User comments about this prime (disclaimer):
User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.
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||Ditto P4 P4|
|notes||Command: /home/ditto/client/pfgw -t -q"9*2^5642513+1" 2>&1|
PFGW Version 184.108.40.206BIT.20110215.x86_Dev [GWNUM 26.5]
Primality testing 9*2^5642513+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 11
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
9*2^5642513+1 is prime! (74024.8219s+0.0037s)
[Elapsed time: 20.56 hours]
Query times: 0.0006 seconds to select prime, 0.0021 seconds to seek comments.