From 1 to infinity. In other words, it can have any amount of digits.
Chat with our AI personalities
M10=2^10-1=1023
A Mersenne number is a number of the form 2n-1. When this number is prime, it is known as a Mersenne prime.A Mersenne prime has the form 2n-1. For 2n-1 to be prime, n must also be prime. Examples are the Mersenne prime 7 (23 - 1 = 7) and the Mersenne prime 127 (27 - 1 = 127)
The Mersenne prime M(43112609) which is 2^43112609 - 1 has 12,978,189 digits. It is the third largest prime known as of 2016.
A prime number has only two factors, 1 and itself. A Mersenne prime is a prime number derived from the algorithm 2n - 1. For example, 23 - 1 = 7 and 7 is a prime number so 3 is a Mersenne prime. Similarly 27 - 1 = 127 and 127 is a prime number so 7 is a Mersenne prime. There are 47 known Mersenne primes, the highest being 43,112,609.
A Mersenne prime has the form 2n-1. For 2n-1 to be prime, n must also be prime. Perfect numbers have the form 2n-1(2n-1) where 2n-1 is a Mersenne prime, so when a new Mersenne prime is discovered, another perfect number is also found.