primU(11915)

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(11915)
Verification status (*):Proven
Official Comment (*):Fibonacci primitive part
Proof-code(s): (*):DK : Dubner, Keller, Cruncher
Decimal Digits:1992   (log10 is 1991.3712168585)
Rank (*):111050 (digit rank is 2)
Entrance Rank (*):4755
Currently on list? (*):no
Submitted:7/1995
Last modified:2/4/2026 10:09:38 UTC
Database id:37380
Status Flags:none
Score (*):27.4237 (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 62
Subcategory: "Fibonacci Primitive Part"
(archival tag id 176234, 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.
fieldvalue
prime_id37380
person_id9
machineUsing: Digital Ocean Droplet
whatprime
notesPFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing 2350806367...7646048361 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Reading factors from helper file helper_1100000000305648677.txt
trial


Running N-1 test using base 11
Generic modular reduction using generic reduction FMA3 FFT length 640 on A 6616-bit number
Running N-1 test using base 17
Generic modular reduction using generic reduction FMA3 FFT length 640 on A 6616-bit number
Running N+1 test using discriminant 23, base 1+sqrt(23)
Generic modular reduction using generic reduction FMA3 FFT length 640 on A 6616-bit number
Calling N-1 BLS with factored part 56.22% and helper 0.02% (168.68% proof)


2350806367...7646048361 is prime! (0.4277s+0.0005s)
[Elapsed time: 5.00 seconds]


Helper File:
2
3
5
7
47
2383
40529
110557
162709
378739
952111
4000949
4434539
135964289
502718717
85607646594577
4994119679922829
7462906334138869
20998263206630329
222448929009201481
271293387891105049
3263039535803245519
138787200818838488796281
1048397584307975025515107529
135263838653434038307643992992133441
8230665343946604939331569597782593791303670001
14192841290391467548135077235113494210575620529
307203719010249860094186673433457816461942845097
669489488461007623536076657264221325654746723636804695546641
3686899971099272395519658410625102018070169824224192782304816619478801
466348954236991210921772044324382381486298186817269350229020961803864897
8947471307752582011065388540586516776213481897254779610325000509767499761
27139570089429625885545473413423169...(144 digits)...31621552551377578389651107902927631
85235482064215693742975473394682326...(236 digits)...57146393635102432048591585303012623
modified2026-02-04 10:09:38
created2026-02-04 10:09:28
id187681

fieldvalue
prime_id37380
person_id9
machineLinux PII 200
whatprp
notesPFGW Version 20020311.x86_Dev (Alpha software, 'caveat utilitor') Reading factors from helper file helper Error opening file helper Running N-1 test using base 11 Primality testing primU(11915) [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 17 Calling Brillhart-Lehmer-Selfridge with factored part 1.42% primU(11915) is PRP! (18.430000 seconds)
modified2003-03-25 17:22:47
created2003-01-07 05:29:46
id63908

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