At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important databases at The Prime Pages: 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:

field (help) value Description: 3 · 10119292-1 Verification status (*): Proven Official Comment: Near-repdigit Proof-code(s): (*): p135 : Heuer, PRP, NewPGen, OpenPFGW Decimal Digits: 119293   (log10 is 119292.477121255) Rank (*): 8451 (digit rank is 1) Entrance Rank (*): 1158 Currently on list? (*): short Submitted: 8/7/2006 08:28:13 CDT Last modified: 8/7/2006 10:26:34 CDT Database id: 78262 Status Flags: none Score (*): 40.0976 (normalized score 0.5433)

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.

Near-repdigit (archivable *)

Prime on list: yes, rank 4
Subcategory: "Near-repdigit"
(archival tag id 187549, tag last modified 2009-02-12 20:01:29)

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 78262 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 3 10 119292 -1 2>&1 [Elapsed time: 9.086 seconds] modified 2007-03-03 21:00:44 created 2006-08-07 08:52:02 id 85622

field value prime_id 78262 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/pfgw -tp -q"3*10^119292-1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 3*10^119292-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 7, base 1+sqrt(7) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(49152,20) to FFT(49152,19) Reduced from FFT(49152,19) to FFT(49152,18) Reduced from FFT(49152,18) to FFT(49152,17) 792580 bit request FFT size=(49152,17) Calling Brillhart-Lehmer-Selfridge with factored part 69.90% 3*10^119292-1 is prime! (5613.6311s+0.0135s) [Elapsed time: 5613 seconds] modified 2007-03-03 21:00:44 created 2006-08-07 08:53:01 id 85623