A prime number is a whole number greater than 1 that has exactly two divisors: 1 and itself. Primes are the building blocks of arithmetic, the foundation of encryption, and a favorite topic in math class. The Prime Number Checker tells you instantly whether a number is prime, and if it is not, it shows the prime factorization and every divisor.
How primality testing works
To decide if a number n is prime, you only need to test for divisors up to the square root of n. If no whole number from 2 up to that square root divides n evenly, then n is prime. This shortcut works because any factor larger than the square root must pair with one smaller than it, which you would already have found.
- 0 and 1 are not prime; primes are defined as greater than 1.
- 2 is the only even prime; every other even number is divisible by 2.
- A composite number has at least one divisor other than 1 and itself.
- Prime factorization expresses a number as a product of primes, and that product is unique for every integer above 1.
How to use the Prime Number Checker
Enter a positive whole number and read the verdict. For a prime, the tool confirms it has no factors beyond 1 and itself. For a composite, it breaks the number into its prime factors and lists the complete set of divisors. All of this happens locally in your browser, with no number ever leaving your device.
A worked example
Take 84. It is even, so 2 divides it, giving 42. Then 2 divides 42 to give 21, then 3 divides 21 to give 7, which is prime. So the prime factorization is 2 times 2 times 3 times 7, often written 2 squared times 3 times 7. From those factors the tool builds the full divisor list: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, and 84.
Now try 97. Its square root is just under 10, so you test 2, 3, 5, and 7. None divide 97 evenly, so it is prime and its only divisors are 1 and 97.
Where primes matter
Beyond the classroom, prime factorization underpins reducing fractions, finding greatest common divisors, and modern cryptography, which relies on the difficulty of factoring very large numbers. The Prime Number Checker makes the small-scale version of that problem transparent, turning an abstract definition into a concrete list of factors you can inspect.
