A prime number is a whole number greater than 1 whose only divisors are 1 and itself: 2, 3, 5, 7, 11, 13, 17, 19, and so on. Everything else greater than 1 is composite — built by multiplying primes together, like 91 = 7 x 13 or 100 = 2^2 x 5^2. Primes are the atoms of arithmetic: the Fundamental Theorem of Arithmetic says every integer factors into primes in exactly one way. They also underpin modern cryptography — the security of much of the internet rests on how hard it is to factor the product of two huge primes, a task that is easy to set up and practically impossible to reverse.
To test a number by hand, you only need to try prime divisors up to its square root. Why? Because factors come in pairs multiplying to the number, and in every pair at least one factor is at or below the square root — so if none divides it up to that point, no larger divisor can either. A few quick pre-checks speed things up: even numbers are divisible by 2, numbers ending in 0 or 5 by 5, and numbers whose digits sum to a multiple of 3 are divisible by 3 (147: 1+4+7 = 12, so 147 = 3 x 49). This calculator applies those rules plus trial division automatically, and it is honest about the edge cases: 1 is neither prime nor composite, and 2 is the only even prime.