24792905469 · 2333333 - 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:24792905469 · 2333333 - 1
Verification status (*):Proven
Official Comment:
Proof-code(s): (*):L249 : Dahlman, NewPGen, PrimeGrid, TPS, LLR
Decimal Digits:100354   (log10 is 100353.62587209)
Rank (*):42757 (digit rank is 1052)
Entrance Rank (*):4075
Currently on list? (*):no
Submitted:10/31/2007 11:59:41 CDT
Last modified:10/31/2007 18:26:46 CDT
Removed (*):1/29/2008 01:03:53 CDT
Database id:82812
Status Flags:none
Score (*):39.5651 (normalized score 0.01)

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/TrialDiv/TrialDiv -q 24792905469 2 333333 -1 2>&1
[Elapsed time: 9.570 seconds]
modified2011-12-27 16:48:49
created2007-10-31 12:22:01

machineWinXP Pent_M 1.7GHz Laptop
notesCommand: pfgw.exe -n -tp -q"24792905469*2^333333-1" 2>&1
Primality testing 24792905469*2^333333-1 [N+1, Brillhart-Lehmer-Selfridge]
PFGW Version 20030811.Win_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4]
Running N+1 test using discriminant 5, base 1+sqrt(5)
N+1: 24792905469*2^333333-1 2Calling Brillhart-Lehmer-Selfridge with factored part 99.99%
24792905469*2^333333-1 is prime! (11513.7207s+0.0315s)
[Elapsed time: 11514 seconds]
modified2011-12-27 16:48:49
created2007-10-31 15:14:51

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