400 (number) + 61 + 67), strictly non-palindromic number 440 = 2 × 5 × 11, the sum of the first seventeen prime numbers, Harshad number, 441 = 3 × 7 = 21 442 = 2 × 13 × 17, sphenic number, sum of eight consecutive primes (41 + 43 + 47 + 53 + 59 + 61 + 67 + 71) A prime number, Sophie Germain prime, Chen prime, Eisenstein prime with no imaginary part, Mertens function sets new low of -9, which stands until 659. 444 = 2 × 3 × 37, refactorable number, Harshad number. 445 = 5 ×
Prime number such as the Meissel–Lehmer algorithm can compute exact values of formula_88 faster than it would be possible to list each prime up to formula_1. The prime number theorem states that formula_88 is asymptotic to formula_94, which is denoted as and means that the ratio of formula_88 to the right-hand fraction approaches 1 as formula_1 grows to infinity. This implies that the likelihood that a randomly chosen number less than formula_1 is prime is (approximately) inversely proportional to the number of digits in formula_1. It also implies that the formula_1th prime number is proportional to formula_101 and therefore that the average