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 is prime. The most basic primality testing routine, trial division, is too slow to be useful for large numbers. One group of modern primality tests is applicable to arbitrary numbers, while more efficient tests are available for numbers of special types. Most primality tests only tell whether their argument is prime or not. Routines that also provide a prime factor of composite arguments (or all of its prime factors) are called factorization algorithms. Prime numbers are also used in computing for checksums, hash tables, and pseudorandom number generators. The most basic method of checking the primality of a given integer