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: 10190004 + 214757412 · 1094998 + 1 Verification status (*): Proven Official Comment: Palindrome Proof-code(s): (*): D : Dubner, Cruncher Decimal Digits: 190005   (log10 is 190004) Rank (*): 17086 (digit rank is 1) Entrance Rank (*): 2556 Currently on list? (*): short Submitted: 5/23/2010 22:42:58 CDT Last modified: 5/24/2010 00:50:21 CDT Database id: 92828 Status Flags: none Score (*): 41.5305 (normalized score 0.2775)

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.

Palindrome (archivable *)

Prime on list: yes, rank 7
Subcategory: "Palindrome"
(archival tag id 210694, tag last modified 2013-01-08 06:50:30)

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 92828 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/pfgw -o -f -q"10^190004+214757412*10^94998+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] trial factoring to 67604831 10^190004+214757412*10^94998+1 has no small factor. [Elapsed time: 931.934 seconds] modified 2011-12-27 16:48:39 created 2010-05-23 22:48:02 id 115036

field value prime_id 92828 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/pfgw -t -q"10^190004+214757412*10^94998+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 10^190004+214757412*10^94998+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(81920,20) to FFT(81920,19) Reduced from FFT(81920,19) to FFT(81920,18) Reduced from FFT(81920,18) to FFT(81920,17) Reduced from FFT(81920,17) to FFT(81920,16) 1262368 bit request FFT size=(81920,16) Calling Brillhart-Lehmer-Selfridge with factored part 34.95% 1/0 10^190004+214757412*10^94998+1 is prime! (6361.5363s+0.0510s) [Elapsed time: 1.77 hours] modified 2010-10-13 12:41:38 created 2010-05-23 22:53:01 id 115037