51 · 26945567 + 1
|Description:||51 · 26945567 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Divides GF(6945564,12) [p286]|
|Proof-code(s): (*):||L4965 : Propper, LLR|
|Decimal Digits:||2090826 (log10 is 2090825.71146407)|
|Rank (*):||118 (digit rank is 1)|
|Entrance Rank (*):||81|
|Currently on list? (*):||short|
|Submitted:||5/26/2020 22:36:06 CDT|
|Last modified:||6/4/2020 18:20:02 CDT|
|Score (*):||48.8948 (normalized score 94.6478)|
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 130928 person_id 9 machine Using: Xeon (pool) 4c+4c 3.5GHz what prime notes Command: /home/caldwell/clientpool/4/pfgw64 -t -q"51*2^6945567+1" 2>&1 PFGW Version 220.127.116.11BIT.20191203.x86_Dev [GWNUM 29.8] Primality testing 51*2^6945567+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 7 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 51*2^6945567+1 is prime! (20145.1838s+0.0030s) [Elapsed time: 5.60 hours] modified 2020-07-07 17:30:10 created 2020-05-26 22:41:02 id 176615
Query times: 0.0019 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.