primU(11545)
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: | primU(11545) |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | Fibonacci primitive part |
| Proof-code(s): (*): | DK : Dubner, Keller, Cruncher |
| Decimal Digits: | 1930 (log10 is 1929.5108753445) |
| Rank (*): | 111193 (digit rank is 1) |
| Entrance Rank (*): | 4773 |
| Currently on list? (*): | no |
| Submitted: | 7/1995 |
| Last modified: | 2/4/2026 10:10:56 UTC |
| Database id: | 37506 |
| Status Flags: | none |
| Score (*): | 27.3252 (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.
- Fibonacci Primitive Part (archivable *)
- Prime on list: no, rank 63
Subcategory: "Fibonacci Primitive Part"
(archival tag id 176250, tag last modified 2024-10-14 00:37:17)
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 37506 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 3242465355...1543145401 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Reading factors from helper file helper_1100000000305638700.txt
trial
Running N-1 test using base 7
Generic modular reduction using generic reduction FMA3 FFT length 640 on A 6410-bit number
Running N-1 test using base 19
Generic modular reduction using generic reduction FMA3 FFT length 640 on A 6410-bit number
Running N-1 test using base 23
Generic modular reduction using generic reduction FMA3 FFT length 640 on A 6410-bit number
Running N+1 test using discriminant 41, base 8+sqrt(41)
Generic modular reduction using generic reduction FMA3 FFT length 640 on A 6410-bit number
Calling N-1 BLS with factored part 34.20% and helper 0.08% (102.70% proof)
3242465355...1543145401 is prime! (0.3625s+0.0003s)
[Elapsed time: 5.00 seconds]
Helper File:
2
3
5
11
13
29
31
61
71
89
199
211
331
421
661
911
1153
2309
2311
3851
4621
9901
19801
21211
31159
36929
39161
86461
141961
229769
474541
492757
518101
572881
767131
900241
988681
1672441
1698689
4832521
9321929
19041331
19630381
37807001
51164521
75954341
84100171
200951521
301880041
582276311
1097233061
1240154177
1550853481
8288823481
13837648441
201562805274601
1112118152741317993811
2638710957802673148692221
9164259601748159235188401
13300834732288369653666579550737311...(93 digits)...60874198230735388202605453815700481
62360246686115310307765470050127424...(93 digits)...67841774743365709581415501808824921
12367585260759018019252191894253690...(117 digits)...80412518265505158198686183208746119
19modified 2026-02-04 10:10:56 created 2026-02-04 10:10:46 id 187683
field value prime_id 37506 person_id 9 machine Linux PII 200 what prp notes PFGW Version 20020311.x86_Dev (Alpha software, 'caveat utilitor') Reading factors from helper file helper Error opening file helper Running N-1 test using base 7 Primality testing primU(11545) [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 19 Running N-1 test using base 23 Calling Brillhart-Lehmer-Selfridge with factored part 4.88% primU(11545) is PRP! (28.920000 seconds) modified 2003-03-25 17:22:47 created 2003-01-07 05:27:03 id 63904
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.