267 · 22662090 + 1
|Description:||267 · 22662090 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Divides Fermat F(2662088)|
|Proof-code(s): (*):||L3234 : Parangalan, PSieve, Srsieve, PrimeGrid, LLR|
|Decimal Digits:||801372 (log10 is 801371.36766839)|
|Rank (*):||1776 (digit rank is 1)|
|Entrance Rank (*):||212|
|Currently on list? (*):||short|
|Submitted:||2/15/2015 05:20:49 CDT|
|Last modified:||2/15/2015 12:20:02 CDT|
|Score (*):||45.9535 (normalized score 4.53)|
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 119333 person_id 9 machine Using: Xeon 4c+4c 3.5GHz what prime notes Command: /home/caldwell/client/pfgw/pfgw64 -t -q"267*2^2662090+1" 2>&1 PFGW Version 18.104.22.168BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing 267*2^2662090+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 7 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 267*2^2662090+1 is prime! (2847.2785s+0.0004s) [Elapsed time: 47.45 minutes] modified 2020-07-07 17:30:17 created 2015-02-15 06:44:33 id 164937
Query times: 0.0004 seconds to select prime, 0.0007 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.