7 · 22915954 + 1
At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important PrimePages database: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.
|Description:||7 · 22915954 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Divides GF(2915953,12) [g322]|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||g279 : Cooper, NewPGen, PRP, Proth.exe|
|Decimal Digits:||877791 (log10 is 877790.46507441)|
|Rank (*):||1943 (digit rank is 1)|
|Entrance Rank (*):||24|
|Currently on list? (*):||short|
|Submitted:||6/9/2008 05:51:26 CDT|
|Last modified:||6/20/2008 13:04:14 CDT|
|Score (*):||46.233 (normalized score 5.1601)|
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 tags.
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.
field value prime_id 85126 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 7 2 2915954 1 2>&1 [Elapsed time: 10.797 seconds] modified 2020-07-07 17:30:39 created 2008-06-09 05:52:02 id 99392
field value prime_id 85126 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/pfgw -t -q"7*2^2915954+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 7*2^2915954+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(393216,19) to FFT(393216,18) Reduced from FFT(393216,18) to FFT(393216,17) Reduced from FFT(393216,17) to FFT(393216,16) 5831922 bit request FFT size=(393216,16) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 7*2^2915954+1 is prime! (77972.6302s+0.0022s) [Elapsed time: 21.66 hours] modified 2020-07-07 17:30:39 created 2008-06-09 05:53:01 id 99393