Mersenne Number Checker
Check whether a nonnegative safe integer equals 2^n - 1 for a positive integer n.
Description
Check whether a nonnegative safe integer equals 2^n - 1 for a positive integer n.
Check whether a nonnegative safe integer equals 2^n - 1 for a positive integer n.
When to use Mersenne Number Checker
Use this tool to test or transform exact integers according to the named number-theory definition, for education, validation, or algorithm checks.
- Integer
- An integer input greater than or equal to 0.
How the calculation works
The formula below determines the tool output. Is a Mersenne number: Whether is a mersenne number is true.1
n is a Mersenne number when n = 2^p − 1 for an integer p Limitations and assumptions
This tool applies an exact integer definition within JavaScript's safe-integer range. It is not an arbitrary-precision factorization or proof system, so do not use rounded measurements or integers beyond the accepted domain as though they were exact.
Alternative or Complementary approaches
Complement a number-property result with its factorization, divisors, digit representation, or a second independent predicate. A true result establishes only the named property and does not imply other properties such as primality.
References
-
Mersenne prime — Wikipedia contributors
Similar or alternative tools
- Emirp Checker
Check whether a prime integer yields a different prime when its digits are reversed.
- Next Prime Calculator
Smallest prime strictly greater than the given integer.
- Prime Number Checker
Check whether a safe integer is prime using deterministic trial division.