4267 · 2701052 + 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:||4267 · 2701052 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Divides GF(701051,5)|
|Proof-code(s): (*):||L1204 : Brown1, PSieve, Srsieve, PrimeGrid, LLR|
|Decimal Digits:||211042 (log10 is 211041.31064287)|
|Rank (*):||26282 (digit rank is 1)|
|Entrance Rank (*):||3123|
|Currently on list? (*):||no|
|Submitted:||9/3/2011 08:40:18 CDT|
|Last modified:||9/3/2011 09:50:41 CDT|
|Score (*):||41.8536 (normalized score 0.0655)|
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.
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 101650 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 4267 2 701052 1 2>&1 [Elapsed time: 9.997 seconds] modified 2020-07-07 17:30:31 created 2011-09-03 08:48:01 id 132812
field value prime_id 101650 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/pfgw -t -q"4267*2^701052+1" 2>&1 PFGW Version 184.108.40.206BIT.20110215.x86_Dev [GWNUM 26.5] Primality testing 4267*2^701052+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 4267*2^701052+1 is prime! (1396.0868s+0.0006s) [Elapsed time: 23.27 minutes] modified 2020-07-07 17:30:31 created 2011-09-03 09:05:30 id 132822