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 factorizations are based on Euclid's lemma: If formula_20 is a prime number and formula_20 divides a product formula_33 of integers formula_34 and formula_35, then formula_20 divides formula_34 or formula_20 divides formula_35 (or both). Conversely, if a number formula_20 has the property that when it divides a product it always divides at least one factor of the product, then formula_20 must be prime. There are infinitely many prime numbers. Another way of saying this is that the sequence of prime numbers never ends. This statement is referred to as "Euclid's theorem" in honor of the ancient Greek mathematician Euclid, since the