180 (number) two square numbers: 12 + 6. It can be expressed as either the sum of six consecutive prime numbers: 19 + 23 + 29 + 31 + 37 + 41, or the sum of eight consecutive prime numbers: 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37. 180 is an Ulam number, which can be expressed as a sum of earlier terms in the Ulam sequence only as 177 + 3. 180 is a 61-gonal number. Half a circle has 180 degrees. Summing Euler's totient function φ("x") over the first + 24 integers gives
Prime number is prime. The most basic primality testing routine, trial division, is too slow to be useful for large numbers. One group of modern primality tests is applicable to arbitrary numbers, while more efficient tests are available for numbers of special types. 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. The most basic method of checking the primality of a given integer