356926524288 + 1
|Description:||356926524288 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||L3209 : McArdle, GenefX64, AthGFNSieve, PrimeGrid, LLR|
|Decimal Digits:||2911151 (log10 is 2911150.111434)|
|Rank (*):||75 (digit rank is 1)|
|Entrance Rank (*):||11|
|Currently on list? (*):||short|
|Submitted:||7/25/2012 10:58:08 CDT|
|Last modified:||8/11/2012 10:13:12 CDT|
|Score (*):||49.909 (normalized score 236.1826)|
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 108492 person_id 9 machine Ditto P4 P4 what trial_divided notes Command: /home/ditto/client/TrialDiv/TrialDiv -q 1 356926 524288 1 2>&1 [Elapsed time: 8.911 seconds] modified 2020-07-07 17:30:25 created 2012-07-25 11:05:02 id 146569
field value prime_id 108492 person_id 9 machine Ditto P4 P4 what prime notes Command: /home/ditto/client/pfgw -t -q"356926^524288+1" 2>&1 PFGW Version 188.8.131.52BIT.20110215.x86_Dev [GWNUM 26.5] Primality testing 356926^524288+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 54.01% 356926^524288+1 is prime! (1465510.5446s+0.2685s) [Elapsed time: 16.96 days] modified 2020-07-07 17:30:25 created 2012-07-25 11:08:01 id 146570
Query times: 0.0004 seconds to select prime, 0.0009 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.