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:||406463527990 · 2801# + 1633050403|
|Verification status (*):||PRP|
|Official Comment:||Consecutive primes arithmetic progression (5,d=30)|
|Proof-code(s): (*):||x38 : Broadhurst, Primo, OpenPFGW|
|Decimal Digits:||1209 (log10 is 1208.9492978236)|
|Rank (*):||103720 (digit rank is 4)|
|Entrance Rank (*):||96021|
|Currently on list? (*):||short|
|Submitted:||11/1/2013 02:46:52 CDT|
|Last modified:||11/1/2013 03:50:56 CDT|
|Status Flags:||Verify, TrialDiv|
|Score (*):||25.8654 (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
- Consecutive Primes in Arithmetic Progression (archivable class *)
- Prime on list: yes, rank 1
Subcategory: "Consecutive primes in arithmetic progression (5,d=*)"
(archival tag id 217406, tag last modified 2013-11-01 03:50:59)
- Arithmetic Progressions of Primes (archivable class *)
- Prime on list: no, rank 156, weight 38.0907985959794
Subcategory: "Arithmetic progression (5,d=*)"
(archival tag id 217407, tag last modified 2017-10-08 23:50:16)
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 -tc -q"406463527990*2801#+1633050403" 2>&1|
PFGW Version 18.104.22.168BIT.20110215.x86_Dev [GWNUM 26.5]
Primality testing 406463527990*2801#+1633050403 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Running N-1 test using base 5
Running N+1 test using discriminant 17, base 1+sqrt(17)
Calling N+1 BLS with factored part 0.17% and helper 0.10% (0.62% proof)
406463527990*2801#+1633050403 is Fermat and Lucas PRP! (0.4932s+0.0003s)
[Elapsed time: 1.00 seconds]
Query times: 0.0004 seconds to select prime, 0.0012 seconds to seek comments.