The nth Prime Page
will now find any of the first 2,623,557,157,654,233 primes or
) for x
up to 100,000,000,000,000,000.
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:||15877# - 1|
|Verification status (*):||Proven|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||CD : Dubner, Caldwell, Cruncher|
|Decimal Digits:||6845 (log10 is 6844.9185759399)|
|Rank (*):||75434 (digit rank is 1)|
|Entrance Rank (*):||79|
|Currently on list? (*):||short|
|Score (*):||31.2644 (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
- Primorial (archivable *)
- Prime on list: yes, rank 10
(archival tag id 194773, tag last modified 2012-03-01 18:50:06)
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||Windows XP P4 1.8GHz|
|notes||Primality testing 15877#-1 [N+1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 33.34% 15877#-1 is prime! (325.337000 seconds) PFGW Version 20021217.Win_Dev (Beta 'caveat utilitor') [FFT v22.7 w/P4] Running N+1 test using discriminant 3, base 3+sqrt(3) Running N+1 test using discriminant 3, base 5+sqrt(3) |
Query times: 0.0004 seconds to select prime, 0.0007 seconds to seek comments.