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:||1749900015 · 26820 - 1|
|Verification status (*):||Proven|
|Official Comment:||Cunningham chain (4p+3)|
|Proof-code(s): (*):||g222 : Jobling, Augustin, NewPGen, Proth.exe|
|Decimal Digits:||2063 (log10 is 2062.26758366322)|
|Rank (*):||90656 (digit rank is 14)|
|Entrance Rank (*):||28308|
|Currently on list? (*):||no|
|Submitted:||1/22/2001 10:13:39 CDT|
|Last modified:||1/22/2001 10:13:39 CDT|
|Score (*):||27.5327 (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
- Cunningham Chains (1st kind) (archivable class *)
- Prime on list: no, rank 27, weight 34.9481765910716
Subcategory: "Cunningham chain (4p+3)"
(archival tag id 212675, tag last modified 2016-11-20 06:50:35)
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 1749900015*2^6820-1 [N+1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 99.56% 1749900015*2^6820-1 is prime! (1.156000 seconds) PFGW Version 1.1 for Windows Running N+1 test using discriminant 11, base 1+sqrt(11) |
Query times: 0.0004 seconds to select prime, 0.0005 seconds to seek comments.