Prime Number Checker

What Is the Prime Number Checker?

This tool checks whether a whole number is prime (divisible only by 1 and itself) using trial division up to the number's square root -- fast even for fairly large numbers.

How to Use This Tool

Enter a whole number. The tool instantly shows a simple Prime or Not Prime result (it does not list factors -- use the Factor Pair Finder for that).

What the Tool Shows and How It Decides

You enter one number, and the result panel displays either Prime or Not Prime, with your number shown underneath in a readable, comma-grouped form. The check itself is a trial division routine: values below 2 are rejected, 2 is accepted, even numbers above 2 are rejected, and then only odd divisors from 3 upward are tested, stopping once the divisor squared exceeds the number. If none of them divides evenly, the number is prime. Only whole numbers can be prime, so a decimal such as 17.4 gets a prompt to enter a whole number instead of being rounded.

Why Checking Only Up to the Square Root Is Enough

If a number n has a factor larger than its square root, it must also have a matching factor smaller than the square root, because the two multiply to n. So if no divisor turns up below the square root, none exists at all. For 97, the square root is a little under 10, so only 3, 5, 7 and 9 need testing; none divide 97, so it is prime. This shortcut is why the check stays fast even for large inputs.

Worked Examples

• 91 looks prime at a glance but is 7 × 13, so the tool reports Not Prime. It is a classic trap.
• 101 has a square root just over 10. Testing 3, 5, 7 and 9 finds no divisor, so it is Prime.
• 1 is reported as Not Prime, since primes must be greater than 1.
• 2 is Prime and is the only even prime, since every other even number is divisible by 2.
• 0 and negative numbers are reported as Not Prime because primality is defined for integers greater than 1.

Finding a Factor When the Answer Is Not Prime

The panel only tells you whether the number is prime, not which factors it has. If you get Not Prime and want to know why, use a factor tool such as the Factor Pair Finder on this site, or test small primes yourself using these divisibility rules:

• Divisible by 2 if it ends in 0, 2, 4, 6 or 8.
• Divisible by 3 if the digits add up to a multiple of 3.
• Divisible by 5 if it ends in 0 or 5.
• Divisible by 11 if the alternating sum of digits is a multiple of 11 (including zero).

Limits and Cautions

• The tool uses standard browser numbers, which are exact for whole numbers up to about 9 quadrillion. Anything larger is refused with a message rather than guessed.
• Trial division slows down as inputs grow. Numbers with many digits, of the kind used in encryption, need specialised algorithms and are not what this tool is designed for.
• It checks one number at a time and does not list all primes in a range.
• Do not use it to verify cryptographic keys or security parameters; use vetted software for that.

Where Primality Matters

Primes appear in fractions (a fraction whose numerator and denominator share no prime factor is fully simplified), in scheduling and gear ratios (coprime counts spread wear evenly), in hash table sizes, and in classroom number theory. A prime check is a quick first step before deciding whether a number can be split into equal groups: a prime count of items can only be arranged in a single row.

Frequently Asked Questions