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 one that is prime; when doing this, a faster probabilistic test can quickly eliminate most composite numbers before a guaranteed-correct algorithm is used to verify that the remaining numbers are prime. The following table lists some of these tests. Their running time is given in terms of formula_1, the number to be tested and, for probabilistic algorithms, the number formula_64 of tests performed. Moreover, formula_219 is an arbitrarily small positive number, and log is the logarithm to an unspecified base. The big O notation means that each time bound should be multiplied by a constant factor to convert it from