400 (number) sum of twelve consecutive primes (13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59) 413 = 7 × 59, Mertens function returns 0, self number 414 = 2 × 3 × 23, Mertens function returns 0, nontotient, Harshad number 415 = 5 × 83, 416 = 2 × 13 417 = 3 × 139 418 = 2 × 11 × 19, sphenic number, A prime number, Sophie Germain prime, Chen prime, Eisenstein prime with no imaginary part, highly cototient number, Mertens function returns 0 A prime
Prime number listing all of the primes or prime factorizations up to a given limit were commonly printed. The oldest method for generating a list of primes is called the sieve of Eratosthenes. The animation shows an optimized variant of this method. Another more efficient sieving method for the same problem is the sieve of Atkin. In advanced mathematics, sieve theory applies similar methods to other problems. Some of the fastest modern tests for whether an arbitrary given number formula_1 is prime are probabilistic (or Monte Carlo) algorithms, meaning that they have a small random chance of producing an incorrect answer. For