17th Century In Birmingham, West Midlands
   HOME
*





17th Century In Birmingham, West Midlands
17 (seventeen) is the natural number following 16 (number), 16 and preceding 18 (number), 18. It is a prime number. Seventeen is the sum of the first four prime numbers. In mathematics 17 is the seventh prime number, which makes seventeen the fourth super-prime, as seven is itself prime. The next prime is 19 (number), 19, with which it forms a twin prime. It is a cousin prime with 13 (number), 13 and a sexy prime with 11 (number), 11 and 23 (number), 23. It is an emirp, and more specifically a permutable prime with 71 (number), 71, both of which are also supersingular prime (moonshine theory), supersingular primes. Seventeen is the sixth Mersenne prime exponent, yielding 131,071. Seventeen is the only prime number which is the sum of four consecutive primes: 2,3,5,7. Any other four consecutive primes summed would always produce an even number, thereby divisible by 2 and so not prime. Seventeen can be written in the form x^y + y^x and x^y - y^x, and, as such, it is a Leyland ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 Ã— 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always pr ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  



MORE