9 · 10719055 + 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: | 9 · 10719055 + 1 |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | [none] |
| Proof-code(s): (*): | L4789 : Kurtovic, Srsieve, Prime95, LLR |
| Decimal Digits: | 719056 (log10 is 719055.95424251) |
| Rank (*): | 4232 (digit rank is 1) |
| Entrance Rank (*): | 3916 |
| Currently on list? (*): | yes |
| Submitted: | 4/18/2024 14:20:23 UTC |
| Last modified: | 4/19/2024 02:37:10 UTC |
| Database id: | 137983 |
| Status Flags: | none |
| Score (*): | 45.6208 (normalized score 1.6369) |
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 137983 person_id 9 machine Using: Digital Ocean Droplet what prime notes Command: /var/www/clientpool/1/pfgw64 -V -f -t -q"9*10^719055+1" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing 9*10^719055+1 [N-1, Brillhart-Lehmer-Selfridge]
trial
Running N-1 test using base 7
Special modular reduction using all-complex AVX-512 FFT length 144K, Pass1=192, Pass2=768, clm=1 on 9*10^719055+1
Running N-1 test using base 13
Special modular reduction using all-complex AVX-512 FFT length 144K, Pass1=192, Pass2=768, clm=1 on 9*10^719055+1
Calling Brillhart-Lehmer-Selfridge with factored part 69.90%
9*10^719055+1 is prime! (3021.3330s+0.0107s)
[Elapsed time: 50.37 minutes]modified 2024-04-19 02:21:10 created 2024-04-19 01:30:48 id 183825
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.