Four primes in a row make you suspicious of the fifth. p = 2, 3, 5, 7 give 3, 7, 31, 127, all prime, so it is tempting to think 2ᵖ − 1 is prime whenever p is. It is not: the workbench computes 2¹¹ − 1 as 2047, and 23 × 89 is the same 2047. Eleven is the first prime exponent that fails, which is why the Mersenne primes are a search and not a formula.
The failure is not random, and that is what makes it testable. If a prime q divides 2ᵖ − 1 with p an odd prime, then 2 has order p modulo q, so p divides q − 1; since q is odd, 2p divides q − 1 too. Every factor of 2047 must therefore be 1 mod 22, and 23 and 89 are the two that multiply back to it. That narrowing is why Mersenne numbers can be attacked at all: it removes almost every candidate before any arithmetic starts.
Answer
2047
How to read it
2¹¹ − 1 on the workbench, with 23 × 89 giving the identical integer. Both are exact: 2047 is far below the 2⁵³ point where the screen stops counting one by one.
Source
Mersenne numbers 2ᵖ − 1, named after Marin Mersenne, whose list in Cogitata Physico-Mathematica (1644) was later proved wrong: 2⁶⁷ − 1 is composite, as Édouard Lucas showed in 1876
Work it in the calculator
These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.