Mersenne prime Mersenne prime In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form for some integer . They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. The exponents which give Mersenne primes are 2, 3, 5, 7, 13, 17, 19, 31, ... and the resulting Mersenne primes are 3, 7, 31, 127, 8191, 131071, 524287, 2147483647, ... . If is a composite number then so is . ( is divisible by both and .)
11 (number) the same number of digits. For instance, if one uses three digits in each group, one gets from 65,637 the calculation (065) - 637 = -572, which is divisible by 11. Another test for divisibility is to separate a number into groups of two consecutive digits (adding a leading zero if there is an odd number of digits), and then add up the numbers so formed; if the result is divisible by 11, the number is divisible by 11. For instance, if the number is 65,637, 06 + 56 + 37 = 99, which is divisible by 11, so 65,637