(50573264686 · (2110503 - 1) + 1) · 2110505 - 5
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: | (50573264686 · (2110503 - 1) + 1) · 2110505 - 5 |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | Consecutive primes arithmetic progression (1,d=6) |
| Unofficial Comments: | This prime has 1 user comment below. |
| Proof-code(s): (*): | p408 : Batalov, PolySieve, OpenPFGW |
| Decimal Digits: | 66541 (log10 is 66540.741202695) |
| Rank (*): | 56452 (digit rank is 2) |
| Entrance Rank (*): | 56427 |
| Currently on list? (*): | yes |
| Submitted: | 11/8/2024 15:07:44 UTC |
| Last modified: | 11/11/2024 01:38:45 UTC |
| Database id: | 138710 |
| Status Flags: | none |
| Score (*): | 38.2986 (normalized score 0.001) |
Archival tags:
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.
- Consecutive Primes in Arithmetic Progression (archivable class *)
- Prime on list: yes, rank 2
Subcategory: "Consecutive primes in arithmetic progression (1,d=*)"
(archival tag id 229736, tag last modified 2024-11-23 01:37:11)
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 138710 person_id 9 machine Using: Digital Ocean Droplet what prime notes Command: /var/www/clientpool/1/pfgw64 -V -f -tc -hhelper_138710 -q"(50573264686*(2^110503-1)+1)*2^110505-5" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing (50573264686*(2^110503-1)+1)*2^110505-5 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Reading factors from helper file helper_138710
trial
Running N-1 test using base 2
Generic modular reduction using generic reduction AVX-512 FFT length 24K on A 221046-bit number
Running N+1 test using discriminant 11, base 2+sqrt(11)
Generic modular reduction using generic reduction AVX-512 FFT length 24K on A 221046-bit number
Running N+1 test using discriminant 11, base 5+sqrt(11)
Generic modular reduction using generic reduction AVX-512 FFT length 24K on A 221046-bit number
Calling N+1 BLS with factored part 50.01% and helper 0.01% (150.03% proof)
(50573264686*(2^110503-1)+1)*2^110505-5 is prime! (638.4502s+0.0012s)
[Elapsed time: 10.67 minutes]
Helper File:
2^110503-1modified 2024-11-11 01:38:45 created 2024-11-11 01:28:05 id 184564
field value prime_id 138710 person_id 9 machine Using: Digital Ocean Droplet what prp notes Command: /var/www/clientpool/1/pfgw64 -V -f -tc -q"(50573264686*(2^110503-1)+1)*2^110505-5" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing (50573264686*(2^110503-1)+1)*2^110505-5 [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial
Running N-1 test using base 2
Generic modular reduction using generic reduction AVX-512 FFT length 24K on A 221046-bit number
Running N+1 test using discriminant 11, base 2+sqrt(11)
Generic modular reduction using generic reduction AVX-512 FFT length 24K on A 221046-bit number
Calling N+1 BLS with factored part 0.02% and helper 0.01% (0.06% proof)
(50573264686*(2^110503-1)+1)*2^110505-5 is Fermat and Lucas PRP! (228.0938s+0.0010s)
[Elapsed time: 3.83 minutes]modified 2024-11-08 15:12:46 created 2024-11-08 15:08:56 id 184557
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.