10150008 + 4798974 · 1075001 + 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.

This prime's information:

Description:10150008 + 4798974 · 1075001 + 1
Verification status (*):Proven
Official Comment (*):Palindrome
Proof-code(s): (*):D : Dubner, Cruncher
Decimal Digits:150009   (log10 is 150008)
Rank (*):37749 (digit rank is 1)
Entrance Rank (*):506
Currently on list? (*):no
Submitted:2/1/2006 20:23:39 CDT
Last modified:2/2/2006 01:59:08 CDT
Database id:76932
Status Flags:none
Score (*):40.8031 (normalized score 0.022)

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 48
Subcategory: "Palindrome"
(archival tag id 187403, tag last modified 2021-10-22 20:37:57)

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.
fieldvalue
prime_id76932
person_id9
machineLinux P4 2.8GHz
whattrial_divided
notesCommand: /home/caldwell/client/pfgw -o -f -q"10^150008+4798974*10^75001+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] trial factoring to 52549468 10^150008+4798974*10^75001+1 has no small factor. [Elapsed time: 794.108 seconds]
modified2020-07-07 17:30:43
created2006-02-01 20:52:01
id82850

fieldvalue
prime_id76932
person_id9
machineLinux P4 2.8GHz
whatprime
notesCommand: /home/caldwell/client/pfgw -t -q"10^150008+4798974*10^75001+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 10^150008+4798974*10^75001+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(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) 996640 bit request FFT size=(65536,16) Running N-1 test using base 19 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) 996640 bit request FFT size=(65536,16) Calling Brillhart-Lehmer-Selfridge with factored part 34.95% 1/0 10^150008+4798974*10^75001+1 is prime! (-288.4646s+0.0300s) [Elapsed time: 18367 seconds]
modified2020-07-07 17:30:43
created2006-02-01 20:53:01
id82851

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