11984747204231082960 · (23363 - 21121) - 3 · 21122 - 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: | 11984747204231082960 · (23363 - 21121) - 3 · 21122 - 5 |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | Quadruplet (2) |
| Proof-code(s): (*): | F : Forbes |
| Decimal Digits: | 1032 (log10 is 1031.4425042958) |
| Rank (*): | 127545 (digit rank is 25) |
| Entrance Rank (*): | 39289 |
| Currently on list? (*): | no |
| Submitted: | 6/3/1999 19:02:18 UTC |
| Last modified: | 11/20/2024 12:53:59 UTC |
| Database id: | 55867 |
| Status Flags: | none |
| Score (*): | 25.3688 (normalized score 0) |
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.
- Quadruplet (archivable class *)
- Prime on list: no, rank 28
Subcategory: "Quadruplet (2)"
(archival tag id 177848, tag last modified 2023-07-22 12:37:40)
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 55867 person_id 9 machine Using: Digital Ocean Droplet what prime notes PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing 11984747204231082960*(2^3363-2^1121)-3*2^1122-5 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Reading factors from helper file helper.php?id=1100000002650698515
trial
Running N-1 test using base 2
Generic modular reduction using generic reduction AVX-512 FFT length 1K on A 3428-bit number
Running N+1 test using discriminant 5, base 1+sqrt(5)
Generic modular reduction using generic reduction AVX-512 FFT length 1K on A 3428-bit number
Calling N-1 BLS with factored part 36.08% and helper 0.67% (108.96% proof)
11984747204231082960*(2^3363-2^1121)-3*2^1122-5 is prime! (0.2724s+0.0002s)
[Elapsed time: 5.00 seconds]
Helper File:
2
3
347
2243
2833
37171
174763
604559
917837
1214741483
1824726041
6088599401
52466311981
58142098448088409
359071640268582342735956401
99171623271154790413320826656970847...(258 digits)...56964108698561163783822705921475217
7
17
25097modified 2024-11-20 12:53:59 created 2024-11-20 12:53:54 id 184606
field value prime_id 55867 person_id 9 machine Linux PII 200 what prp notes PFGW Version 20020311.x86_Dev (Alpha software, 'caveat utilitor') Running N-1 test using base 2 Primality testing 11984747204231082960*(2^3363-2^1121)-3*2^1122-5 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 5, base 1+sqrt(5) Running N+1 test using discriminant 5, base 2+sqrt(5) Running N+1 test using discriminant 5, base 4+sqrt(5) Running N+1 test using discriminant 5, base 5+sqrt(5) Running N+1 test using discriminant 5, base 7+sqrt(5) Running N+1 test using discriminant 5, base 8+sqrt(5) Calling N-1 BLS with factored part 1.96% and helper 0.67% (6.60% proof) 11984747204231082960*(2^3363-2^1121)-3*2^1122-5 is Fermat and Lucas PRP! (46.650000 seconds) modified 2003-03-25 17:23:04 created 2003-01-04 05:33:31 id 60586
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.