TOPICS
Search

Double Mersenne Number


A double Mersenne number is a number of the form

 M_(M_n)=2^(2^n-1)-1,

where M_n is a Mersenne number. The first few double Mersenne numbers are 1, 7, 127, 32767, 2147483647, 9223372036854775807, ... (OEIS A077585).

A double Mersenne number that is prime is called a double Mersenne prime. Since a Mersenne prime M_n can be prime only for prime n, a double Mersenne prime can be prime only for prime M_n, i.e., M_n a Mersenne prime. Double Mersenne numbers are prime for n=2, 3, 5, 7, corresponding to the sequence 7, 127, 2147483647, 170141183460469231731687303715884105727, ... (OEIS A077586).

The next four M_(M_(13)), M_(M_(17)), M_(M_(19)), and M_(M_(31)) have known factors summarized in the following table. The status of all other double Mersenne numbers is unknown, with M_(M_(61)) being the smallest unresolved case. Since this number has 694127911065419642 digits, it is much too large for the usual Lucas-Lehmer test to be practical. The only currently practical method of determining the status of this number is therefore attempting to find small divisors (or discovery of an efficient primality test for this type of number).

Forbes (2004) organized an early distributed search for factors of M_(M_(61)). As of 2026, the DoubleMersennes.org distributed search had found no factor of M_(M_(61)) and had checked possible factors of the form 2kM_(61)+1 through k=6×10^(17). Edgington maintains a list of known factorizations of double Mersenne numbers.

nfactors/cofactorreference
13338193759479Wilfrid Keller (1976)
210206826754181103207028761697008013415622289Phil Moore (2003)
C2410
17231733529Raphael Robinson (1957)
64296354767Wilfrid Keller (1981)
C39438
1962914441Raphael Robinson (1957)
5746991873407Edgington and Keller (1994)
824271579602877114508714150039Phil Moore (2000)
2106734551102073202633922471Phil Moore (2003)
65997004087015989956123720407169Phil Moore (2011)
4565880376922810768406683467841114102689Phil Moore (2023)
C157677
31295257526626031Guy Haworth (1983, 1987)
87054709261955177Keller (1994)
242557615644693265201Keiser and Forbes (1999)
178021379228511215367151Mayer (2005)
C646456918

See also

Catalan-Mersenne Number, Mersenne Number, Mersenne Prime

Explore with Wolfram|Alpha

References

DoubleMersennes.org. "Double Mersennes Prime Search." https://www.doublemersennes.org/.DoubleMersennes.org. "Status of MM_p Where M_p Is a Mersenne Prime." https://www.doublemersennes.org/history.php.Edgington, W. "Will Edgington's Mersenne Page." http://www.garlic.com/~wedgingt/mersenne.html.Edgington, W. "Status of M(M(p)) where M(p) is a Mersenne Prime." http://anthony.d.forbes.googlepages.com/mm61prog.htm.Forbes, T. "MM61: A Search for a Factor of 2^(2^(61)-1)-1. Progress: 2 March 2004." http://www.ltkz.demon.co.uk/ar2/mm61prog.htm.Forbes, T. "MM61: A Search for a Factor of 2^(2^(61)-1)-1." http://anthony.d.forbes.googlepages.com/mm61.htm.Haworth, G. M. Notes on Mersenne Numbers. Privately produced manuscript, 1987.Mayer, E. W. "Fourth Known Factor of M(M31)." 21 Jun 2005. https://listserv.nodak.edu/cgi-bin/wa.exe?A2=ind0506&L=nmbrthry&T=0&F=&S=&P=2514.Sloane, N. J. A. Sequences A077585 and A077586 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Double Mersenne Number

Cite this as:

Weisstein, Eric W. "Double Mersenne Number." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DoubleMersenneNumber.html

Subject classifications