(16472224158 · (2166678 - 1) - 1) · 283341 - 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:(16472224158 · (2166678 - 1) - 1) · 283341 - 5
Verification status (*):Proven
Official Comment (*):Consecutive primes arithmetic progression (1,d=6)
Unofficial Comments:This prime has 2 user comments below.
Proof-code(s): (*):p408 : Batalov, PolySieve, OpenPFGW
Decimal Digits:75274   (log10 is 75273.435238157)
Rank (*):57191 (digit rank is 4)
Entrance Rank (*):54978
Currently on list? (*):no
Submitted:11/23/2024 01:14:08 UTC
Last modified:11/23/2024 13:51:11 UTC
Database id:138732
Status Flags:none
Score (*):38.6788 (normalized score 0.0008)

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: no, rank 8
Subcategory: "1/2"
(archival tag id 238559, tag last modified 2025-05-13 18:37:10)

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.

Serge Batalov writes (23 Nov 2024):  (report abuse)
Use (2^83339 + 1)/3 as a helper factor for N+1 primality proof (plus small factors 2, 3, 41039, 61333).
Such pairs are called "sexy" primes.

Jeppe Stig Nielsen writes (23 Nov 2024):  (report abuse)

Alternative representation:

(8236112079*(2^83339-1)*2^83342-4)*(2^83339+1)-1

For the primality of the helper prime, see page for (2^83339+1)/3.

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.
fieldvalue
prime_id138732
person_id9
machineUsing: Digital Ocean Droplet
whatprime
notesCommand: /var/www/clientpool/1/pfgw64 -V -f -tc -hhelper_138732 -q"(16472224158*(2^166678-1)-1)*2^83341-5" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing (16472224158*(2^166678-1)-1)*2^83341-5 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Reading factors from helper file helper_138732
trial


Running N-1 test using base 2
Generic modular reduction using generic reduction AVX-512 FFT length 24K on A 250055-bit number
Running N+1 test using discriminant 13, base 1+sqrt(13)
Generic modular reduction using generic reduction AVX-512 FFT length 24K on A 250055-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 42/333485 ERROR: ROUND OFF 0.47943>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 13, base 1+sqrt(13)
Generic modular reduction using generic reduction AVX-512 FFT length 25K on A 250055-bit number
Calling N+1 BLS with factored part 33.34% and helper 0.02% (100.04% proof)


(16472224158*(2^166678-1)-1)*2^83341-5 is prime! (404.6415s+0.0009s)
[Elapsed time: 6.75 minutes]


Helper File:
(2^83339 + 1)/3
2
3
41039
61333
modified2024-11-23 13:51:11
created2024-11-23 13:44:26
id184727

fieldvalue
prime_id138732
person_id9
machineUsing: Digital Ocean Droplet
whatprp
notesCommand: /var/www/clientpool/1/pfgw64 -V -f -t -hhelper_138732 -q"(16472224158*(2^166678-1)-1)*2^83341-5" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing (16472224158*(2^166678-1)-1)*2^83341-5 [N-1, Brillhart-Lehmer-Selfridge]
Reading factors from helper file helper_138732
Prime_Testing_Warning,


Running N-1 test using base 2
Generic modular reduction using generic reduction AVX-512 FFT length 24K on A 250055-bit number
Calling Brillhart-Lehmer-Selfridge with factored part 0.02%


(16472224158*(2^166678-1)-1)*2^83341-5 is PRP! (60.6391s+0.0016s)
[Elapsed time: 65.00 seconds]


Helper File:
(2^83339 + 1)/3
2
3
41039
61333
modified2024-11-23 13:43:11
created2024-11-23 13:42:06
id184726

fieldvalue
prime_id138732
person_id9
machineUsing: Digital Ocean Droplet
whatprp
notesCommand: /var/www/clientpool/1/pfgw64 -V -f -tc -q"(16472224158*(2^166678-1)-1)*2^83341-5" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing (16472224158*(2^166678-1)-1)*2^83341-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 250055-bit number
Running N+1 test using discriminant 13, base 1+sqrt(13)
Generic modular reduction using generic reduction AVX-512 FFT length 24K on A 250055-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 64/250113 ERROR: ROUND OFF 0.48168>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 13, base 1+sqrt(13)
Generic modular reduction using generic reduction AVX-512 FFT length 25K on A 250055-bit number
Calling N-1 BLS with factored part 0.02% and helper 0.01% (0.06% proof)


(16472224158*(2^166678-1)-1)*2^83341-5 is Fermat and Lucas PRP! (259.0052s+0.0011s)
[Elapsed time: 4.33 minutes]
modified2024-11-23 01:20:42
created2024-11-23 01:16:22
id184725

Query times: 0.0002 seconds to select prime, 0.0005 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.