2339662057597 · 103490 + 3
|Description:||2339662057597 · 103490 + 3|
|Verification status (*):||PRP|
|Official Comment (*):||Quadruplet (2)|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||c67 : Batalov, NewPGen, OpenPFGW, Primo|
|Decimal Digits:||3503 (log10 is 3502.3691531321)|
|Rank (*):||88837 (digit rank is 4)|
|Entrance Rank (*):||76796|
|Currently on list? (*):||short|
|Submitted:||12/21/2013 16:21:03 CDT|
|Last modified:||12/21/2013 16:50:28 CDT|
|Status Flags:||Verify, TrialDiv|
|Score (*):||29.1823 (normalized score 0)|
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 116695 person_id 9 machine RedHat P4 P4 what prp notes Command: /home/caldwell/client/pfgw -tc -q"2339662057597*10^3490+3" 2>&1 PFGW Version 220.127.116.11BIT.20110215.x86_Dev [GWNUM 26.5] Primality testing 2339662057597*10^3490+3 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Running N-1 test using base 3 Running N-1 test using base 5 Running N+1 test using discriminant 13, base 2+sqrt(13) Calling N-1 BLS with factored part 0.23% and helper 0.04% (0.75% proof) 2339662057597*10^3490+3 is Fermat and Lucas PRP! (2.8987s+0.0003s) [Elapsed time: 3.00 seconds] modified 2020-07-07 17:30:18 created 2013-12-21 16:23:06 id 162204
Query times: 0.0004 seconds to select prime, 0.0007 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.