2 · 33648969 + 1
|Description:||2 · 33648969 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Divides Phi(3^3648964,2) [g427]|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||L5043 : Vanderveen1, Propper, LLR|
|Decimal Digits:||1741001 (log10 is 1741000.96874315)|
|Rank (*):||136 (digit rank is 1)|
|Entrance Rank (*):||100|
|Currently on list? (*):||short|
|Submitted:||2/9/2020 13:04:27 CDT|
|Last modified:||5/22/2020 18:20:03 CDT|
|Score (*):||48.3335 (normalized score 60.0125)|
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 130431 person_id 9 machine Using: Xeon 4c+4c 3.5GHz what prime notes Command: /home/caldwell/client/pfgw/pfgw64 -t -q"2*3^3648969+1" 2>&1 PFGW Version 184.108.40.206BIT.20191203.x86_Dev [GWNUM 29.8] Primality testing 2*3^3648969+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Running N-1 test using base 5 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 2*3^3648969+1 is prime! (59282.9686s+0.0405s) [Elapsed time: 16.47 hours] modified 2020-07-07 17:30:10 created 2020-02-09 13:07:21 id 176117
Query times: 0.002 seconds to select prime, 0.0007 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.