Mersenne Prime Checker

M(n) = 2ⁿ − 1

All Tools

Loading tool...

About Mersenne Prime Checker

A Mersenne prime checker testing if M(n) = 2ⁿ−1 is prime using the Lucas-Lehmer test. Shows known Mersenne primes, perfect number connection, and the GIMPS project. Tests small n directly. Client-side.

Mersenne Prime Checker Features

  • Mersenne test
  • Lucas-Lehmer
  • Known primes
  • Perfect numbers
  • GIMPS

More Calculators Tools

Explore all 639 other calculators tools available on Generatr

1-Sample Z-Test Calculator2-Sample Z-Test Calculator3D Surface Area CalculatorA/B Testing Significance CalculatorAbsolute Value CalculatorAbundant Number CheckerAccelerated Aging CalculatorAchromatic Number CalculatorAcyclic Chromatic Number CalculatorAdditive Persistence CalculatorAge CalculatorAging Test CalculatorAlbertson Index CalculatorAlgebraic Connectivity CalculatorAliquot Sequence CalculatorAliquot Sum CalculatorAlternating Series Test CalculatorAmicable Number FinderAnnuity CalculatorAPY CalculatorAquarium CO2 Drop CheckerArea CalculatorArea Under Curve CalculatorArithmetic Sequence CalculatorArmstrong Number CalculatorASCVD Risk CalculatorAspect Ratio CalculatorAtom Bond Connectivity CalculatorAugmented Eccentric Connectivity CalculatorAugmented Zagreb Index Calculator
View all 639 calculators tools
Advertisement
Advertisement