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:||284787490256 · 6701# + 1|
|Verification status (*):||Proven|
|Official Comment:||Cunningham chain 2nd kind (8p-7)|
|Proof-code(s): (*):||p364 : Batalov, NewPGen, OpenPFGW|
|Decimal Digits:||2879 (log10 is 2878.8523663627)|
|Rank (*):||87641 (digit rank is 1)|
|Entrance Rank (*):||81988|
|Currently on list? (*):||short|
|Submitted:||3/19/2015 23:09:33 CDT|
|Last modified:||3/19/2015 23:20:31 CDT|
|Score (*):||28.5721 (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 (2nd kind) (archivable class *)
- Prime on list: yes, rank 2, weight 44.4594804428292
Subcategory: "Cunningham chain 2nd kind (8p-7)"
(archival tag id 217932, tag last modified 2016-08-02 06:20:04)
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||Using: Xeon 4c+4c 3.5GHz|
|notes||Command: /home/caldwell/client/pfgw/pfgw64 -t -q"284787490256*6701#+1" 2>&1|
PFGW Version 184.108.40.206BIT.20130722.x86_Dev [GWNUM 27.11]
Primality testing 284787490256*6701#+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 6709
Calling Brillhart-Lehmer-Selfridge with factored part 33.39%
284787490256*6701#+1 is prime! (1.0670s+0.0011s)
[Elapsed time: 1.00 seconds]
Query times: 0.0004 seconds to select prime, 0.0005 seconds to seek comments.