59912 · 51500861 + 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: | 59912 · 51500861 + 1 |
---|---|
Verification status (*): | Proven |
Official Comment (*): | [none] |
Unofficial Comments: | This prime has 1 user comment below. |
Proof-code(s): (*): | L3772 : Ottusch, Srsieve, PrimeGrid, LLR |
Decimal Digits: | 1049062 (log10 is 1049061.5971916) |
Rank (*): | 1770 (digit rank is 1) |
Entrance Rank (*): | 66 |
Currently on list? (*): | short |
Submitted: | 1/17/2014 20:55:06 UTC |
Last modified: | 5/20/2023 20:59:19 UTC |
Database id: | 116924 |
Status Flags: | none |
Score (*): | 46.7799 (normalized score 5.4955) |
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.
Verification data:
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 116924 person_id 9 machine Ditto P4 P4 what prime notes Command: /home/ditto/client/pfgw -t -q"59912*5^1500861+1" 2>&1 PFGW Version 3.4.5.32BIT.20110215.x86_Dev [GWNUM 26.5] Primality testing 59912*5^1500861+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 59912*5^1500861+1 is prime! (61566.0453s+0.0904s) [Elapsed time: 17.10 hours] modified 2020-07-07 22:30:18 created 2014-01-17 21:08:01 id 162435
Query times: 0.0003 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.