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 this decreases exponentially with the number of tests, it provides high confidence (although not certainty) that a number that passes the repeated test is prime. On the other hand, if the test ever fails, then the number is certainly composite. A composite number that passes such a test is called a pseudoprime. In contrast, some other algorithms guarantee that their answer will always be correct: primes will always be determined to be prime and composites will always be determined to be composite. For instance, this is true of trial division. The algorithms with guaranteed-correct output include both deterministic (non-random) algorithms,