 Most primality tests only tell whether their argument is prime or not.Routines that also provide a prime factor of composite arguments (or all of its prime factors) are called factorization algorithms.Prime numbers are also used in computing for checksums, hash tables, and pseudorandom number generators.