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 hash functions by choosing random linear functions modulo large prime numbers. Carter and Wegman generalized this method to formula_64-independent hashing by using higher-degree polynomials, again modulo large primes. As well as in the hash function, prime numbers are used for the hash table size in quadratic probing based hash tables to ensure that the probe sequence covers the whole table. Some checksum methods are based on the mathematics of prime numbers. For instance the checksums used in International Standard Book Numbers are defined by taking the rest of the number modulo 11, a prime number. Because 11 is prime this