9 · 2435743 + 1

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.

Description:9 · 2435743 + 1
Verification status (*):Proven
Official Comment (*):Divides GF(435742,10)
Proof-code(s): (*):g122 : Nohara, Proth.exe
Decimal Digits:131173   (log10 is 131172.66764312)
Rank (*):40519 (digit rank is 1)
Entrance Rank (*):130
Currently on list? (*):no
Submitted:7/9/2003 02:15:45 CDT
Last modified:7/9/2003 02:15:45 CDT
Database id:65451
Status Flags:none
Score (*):40.39 (normalized score 0.0149)

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.
Generalized Fermat Divisors (bases 3,5,6,10,12) (archivable *)
Prime on list: no, rank 26, weight 42.587279656562
Subcategory: "Divides GF(*,10)"
(archival tag id 187445, tag last modified 2021-02-18 04:50:24)

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.
machineWinXP P4 1.8GHz
notesPFGW Version 20030108.Win_Dev (Alpha 'caveat utilitor') [FFT v22.12 w/P4] Running N-1 test using base 5 N-1: 9*2^435743Primality testing 9*2^435743+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 9*2^435743+1 is prime! (1779.056000 seconds) +1
modified2020-07-07 17:30:47
created2003-07-09 21:19:05

Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.