31

This number is a prime.

The minimal number of moves required in a Tower of Hanoi puzzle containing five discs. The general solution to this puzzle requires a Mersenne number (i.e., 2^n - 1) of moves, where n is the number of discs.