6759 · 2686773 + 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:6759 · 2686773 + 1
Verification status (*):Proven
Official Comment:
Proof-code(s): (*):L2683 : Utsey, PSieve, Srsieve, PrimeGrid, LLR
Decimal Digits:206744   (log10 is 206743.10309459)
Rank (*):21183 (digit rank is 1)
Entrance Rank (*):3806
Currently on list? (*):no
Submitted:9/13/2011 14:57:44 CDT
Last modified:9/13/2011 16:20:23 CDT
Removed (*):1/6/2012 16:35:29 CDT
Database id:101965
Status Flags:none
Score (*):41.7903 (normalized score 0.1398)

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_id101965
person_id9
machineDitto P4 P4
whattrial_divided
notesCommand: /home/ditto/client/TrialDiv/TrialDiv -q 6759 2 686773 1 2>&1
[Elapsed time: 10.112 seconds]
modified2011-12-27 16:48:29
created2011-09-13 15:05:01
id133496

fieldvalue
prime_id101965
person_id9
machineDitto P4 P4
whatprime
notesCommand: /home/ditto/client/pfgw -t -q"6759*2^686773+1" 2>&1
PFGW Version 3.4.5.32BIT.20110215.x86_Dev [GWNUM 26.5]
Primality testing 6759*2^686773+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 11
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
6759*2^686773+1 is prime! (1402.9230s+0.0006s)
[Elapsed time: 23.38 minutes]
modified2011-12-27 16:48:29
created2011-09-13 15:30:21
id133504

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