27 · 22218064 + 1
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
GIMPS has discovered a new largest known prime number: 282589933-1 (24,862,048 digits)

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:27 · 22218064 + 1
Verification status (*):Proven
Official Comment:
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):L690 : Cholt, Srsieve, PrimeGrid, LLR
Decimal Digits:667706   (log10 is 667705.2276662)
Rank (*):1490 (digit rank is 1)
Entrance Rank (*):56
Currently on list? (*):short
Submitted:12/23/2009 14:27:01 CDT
Last modified:12/24/2009 03:50:22 CDT
Database id:91240
Status Flags:none
Score (*):45.3933 (normalized score 3.6979)

User comments about this prime (disclaimer):

User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.

PrimeGrid writes (11 Sep 2014): 
27*2^2218064+1 Divides xGF(2218063,9,5)
27*2^2218064+1 Divides xGF(2218063,10,7)

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.
machineDitto P4 P4
notesCommand: /home/ditto/client/TrialDiv/TrialDiv -q 27 2 2218064 1 2>&1
[Elapsed time: 10.443 seconds]
modified2011-12-27 16:48:41
created2009-12-23 14:35:01

machineDitto P4 P4
notesCommand: /home/ditto/client/pfgw -t -q"27*2^2218064+1" 2>&1
PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4]
Primality testing 27*2^2218064+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 5
Using SSE2 FFT
Adjusting authentication level by 1 for PRIMALITY PROOF
Reduced from FFT(327680,19) to FFT(327680,18)
Reduced from FFT(327680,18) to FFT(327680,17)
Reduced from FFT(327680,17) to FFT(327680,16)
4436146 bit request FFT size=(327680,16)
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
27*2^2218064+1 is prime! (-1490.5603s+0.0000s)
[Elapsed time: 12.78 hours]
modified2010-03-13 18:56:31
created2009-12-23 14:38:01

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