10200000 + 47960506974 · 1099995 + 1
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help

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:10200000 + 47960506974 · 1099995 + 1
Verification status (*):Proven
Official Comment:Palindrome
Proof-code(s): (*):p288 : Boncompagni, OpenPFGW
Decimal Digits:200001   (log10 is 200000)
Rank (*):25700 (digit rank is 5)
Entrance Rank (*):2996
Currently on list? (*):no
Submitted:9/17/2010 10:05:56 CDT
Last modified:9/17/2010 12:20:32 CDT
Database id:94993
Status Flags:none
Score (*):41.6883 (normalized score 0.1132)

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 30
Subcategory: "Palindrome"
(archival tag id 210840, tag last modified 2016-01-10 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.
machineRedHat P4 P4
notesCommand: /home/caldwell/client/pfgw -o -f -q"10^200000+47960506974*10^99995+1" 2>&1
PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4]
trial factoring to 71399937
10^200000+47960506974*10^99995+1 has no small factor.
[Elapsed time: 1026.450 seconds]
modified2011-12-27 16:48:37
created2010-09-17 10:18:02

machineDitto P4 P4
notesCommand: /home/ditto/client/pfgw -t -q"10^200000+47960506974*10^99995+1" 2>&1
PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4]
Primality testing 10^200000+47960506974*10^99995+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(98304,20) to FFT(98304,19)
Reduced from FFT(98304,19) to FFT(98304,18)
Reduced from FFT(98304,18) to FFT(98304,17)
Reduced from FFT(98304,17) to FFT(98304,16)
1328780 bit request FFT size=(98304,16)
Calling Brillhart-Lehmer-Selfridge with factored part 34.95%

10^200000+47960506974*10^99995+1 is prime! (-901.8146s+0.0400s)
[Elapsed time: 2.17 hours]
modified2010-10-13 12:41:34
created2010-09-17 10:08:01

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