Migration complete - please let us know if anything isn't working.
11 · 215502315 + 1
At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important PrimePages database: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.
This prime's information:
|Description:||11 · 215502315 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||[none]|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||L4965 : Propper, LLR|
|Decimal Digits:||4666663 (log10 is 4666662.8586244)|
|Rank (*):||36 (digit rank is 1)|
|Entrance Rank (*):||35|
|Currently on list? (*):||short|
|Submitted:||1/8/2023 17:42:38 UTC|
|Last modified:||3/11/2023 15:54:10 UTC|
|Score (*):||51.3543 (normalized score 725.7588)|
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 134761 person_id 9 machine Using: Dual Intel Xeon Gold 5222 CPUs 3.8GHz what prime notes Command: /home/caldwell/clientpool/1/pfgw64 -t -q"11*2^15502315+1" 2>&1
PFGW Version 126.96.36.199BIT.20191203.x86_Dev [GWNUM 29.8]
Primality testing 11*2^15502315+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
11*2^15502315+1 is prime! (40475.3507s+0.0028s)
[Elapsed time: 11.24 hours]
modified 2023-01-09 05:01:37 created 2023-01-08 17:47:02 id 180541
Query times: 0.0003 seconds to select prime, 0.0005 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.