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 theorem remaining terms. The "Riemann hypothesis" statement depends on the fact that the largest proper divisor of can be no larger than . Prime number theorem In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann (in particular, the Riemann zeta function). The first such