7407 · 2920500 + 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:7407 · 2920500 + 1
Verification status (*):Proven
Official Comment:
Proof-code(s): (*):L1745 : Cholt, PSieve, Srsieve, PrimeGrid, LLR
Decimal Digits:277102   (log10 is 277101.98065104)
Rank (*):9938 (digit rank is 1)
Entrance Rank (*):2274
Currently on list? (*):no
Submitted:6/25/2012 02:26:39 CDT
Last modified:6/25/2012 03:20:25 CDT
Removed (*):3/5/2013 18:24:15 CDT
Database id:107922
Status Flags:none
Score (*):42.6912 (normalized score 0.4555)

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_id107922
person_id9
machineDitto P4 P4
whattrial_divided
notesCommand: /home/ditto/client/TrialDiv/TrialDiv -q 7407 2 920500 1 2>&1
[Elapsed time: 10.219 seconds]
modified2012-07-16 11:32:58
created2012-06-25 02:35:01
id145430

fieldvalue
prime_id107922
person_id9
machineDitto P4 P4
whatprime
notesCommand: /home/ditto/client/pfgw -t -q"7407*2^920500+1" 2>&1
PFGW Version 3.4.5.32BIT.20110215.x86_Dev [GWNUM 26.5]
Primality testing 7407*2^920500+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 5
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
7407*2^920500+1 is prime! (2130.0975s+0.0007s)
[Elapsed time: 35.50 minutes]
modified2012-07-16 11:32:58
created2012-06-25 02:38:01
id145431

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