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 and the RSA cryptosystem were invented, using prime numbers as their basis. The increased practical importance of computerized primality testing and factorization led to the development of improved methods capable of handling large numbers of unrestricted form. The mathematical theory of prime numbers also moved forward with the Green–Tao theorem (2004) on long arithmetic progressions of prime numbers, and Yitang Zhang's 2013 proof that there exist infinitely many prime gaps of bounded size. Most early Greeks did not even consider 1 to be a number, so they could not consider its primality. A few mathematicians from this time also considered