
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:  10^{150006} + 7426247 · 10^{75000} + 1 
Verification status (*):  Proven 
Official Comment:  Palindrome 
Proofcode(s): (*):  p5 : Jobling, OpenPFGW 
Decimal Digits:  150007 (log_{10} is 150006) 
Rank (*):  31589 (digit rank is 2) 
Entrance Rank (*):  479 
Currently on list? (*):  no 
Submitted:  12/26/2005 09:30:36 CDT 
Last modified:  12/26/2005 14:41:36 CDT 
Database id:  76550 
Status Flags:  none 
Score (*):  40.8031 (normalized score 0.0536) 

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: no, rank 39
Subcategory: "Palindrome"
(archival tag id 187404, tag last modified 20160110 02:20:35)
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  76550 
person_id  9 
machine  Linux P4 2.8GHz 
what  trial_divided 
notes  Command: /home/caldwell/client/pfgw o f q"10^150006+7426247*10^75000+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] trial factoring to 52548793 10^150006+7426247*10^75000+1 has no small factor. [Elapsed time: 771.980 seconds]

modified  20051228 20:24:31 
created  20051226 09:52:00 
id  81956 

field  value 
prime_id  76550 
person_id  9 
machine  Linux P4 2.8GHz 
what  prime 
notes  Command: /home/caldwell/client/pfgw f t q"10^150006+7426247*10^75000+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 10^150006+7426247*10^75000+1 [N1, BrillhartLehmerSelfridge] trial factoring to 52548793 Running N1 test using base 7 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) Reduced from FFT(65536,18) to FFT(65536,17) Reduced from FFT(65536,17) to FFT(65536,16) 996628 bit request FFT size=(65536,16) Running N1 test using base 11 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) Reduced from FFT(65536,18) to FFT(65536,17) Reduced from FFT(65536,17) to FFT(65536,16) 996628 bit request FFT size=(65536,16) Calling BrillhartLehmerSelfridge with factored part 34.95% 1/0
10^150006+7426247*10^75000+1 is prime! (402.4746s+0.0300s) [Elapsed time: 17315 seconds]

modified  20051228 20:24:31 
created  20051226 09:53:01 
id  81957 

Query times: 0.0004 seconds to select prime, 0.0005 seconds to seek comments.
