11 (number) to be a Mersenne prime, the converse is not true: 2 − 1 = 2047 which is 23 × 89. 11 raised to the nth power is the nth row of Pascal's Triangle. (This works for any base, but the number eleven must be changed to the number represented as 11 in that base; for example, in duodecimal this must be done using thirteen.) 11 is a Heegner number, meaning that the ring of integers of the field formula_1 has the property of unique factorization. One consequence of this is that there exists at most one point on the elliptic
Prime number such as the Meissel–Lehmer algorithm can compute exact values of formula_88 faster than it would be possible to list each prime up to formula_1. The prime number theorem states that formula_88 is asymptotic to formula_94, which is denoted as and means that the ratio of formula_88 to the right-hand fraction approaches 1 as formula_1 grows to infinity. This implies that the likelihood that a randomly chosen number less than formula_1 is prime is (approximately) inversely proportional to the number of digits in formula_1. It also implies that the formula_1th prime number is proportional to formula_101 and therefore that the average