Learn what a prime number is, why 1 isn't prime, and the fastest way to check whether a number is prime.
Prime numbers are the building blocks every other whole number is made from, and the definition is simpler than it might seem, though one common exception (the number 1) trips people up regularly.
A prime number is a whole number greater than 1 that has exactly two positive divisors: 1 and itself. Numbers with more than two divisors, like 12 (divisible by 1, 2, 3, 4, 6, and 12), are called composite numbers instead.
By the definition above, a prime number needs exactly two distinct divisors. The number 1 only has one divisor, itself, so it doesn’t meet the definition and is classified as neither prime nor composite.
The straightforward method is trial division: check whether the number is evenly divisible by any integer from 2 up to its square root. If none of them divide evenly, the number is prime.
Is 97 prime?
The square root of 97 is approximately 9.85, so only integers from 2 to 9 need checking: 97 ÷ 2, 3, 4, 5, 6, 7, 8, and 9 all leave a remainder.
97 is prime.
The Prime Number Checker checks whether any number is prime instantly, without manual trial division.
Prime Number Checker
No. A prime number must have exactly two distinct divisors (1 and itself); 1 only has one divisor, so it’s excluded from both the prime and composite categories.
Yes, and it’s the only even prime number, since every other even number is divisible by 2 in addition to 1 and itself.
Check for divisibility only up to the number’s square root, rather than checking every integer up to the number itself, which is far more efficient for large numbers.
A prime number has exactly two divisors (1 and itself). A composite number has more than two divisors. The number 1 fits neither category.
No. Many odd numbers are composite, such as 9, 15, or 21, which have divisors beyond just 1 and themselves.
Find the right tool, or keep reading Brekzy's other guides.