How to Check if a Number Is Prime

You’re checking homework, exploring a number theory curiosity, or just want to know whether 4,847 is prime, and testing it by hand means trial-dividing by every prime up to its square root — tedious for small numbers, genuinely time-consuming for larger ones. Primality itself is a simple concept (a number with no divisors other than 1 and itself), but verifying it manually scales badly as numbers get larger.

Beyond a flat yes-or-no, it’s often useful to know more: if a number isn’t prime, what’s its smallest factor? And what are the nearest primes around it, for context or for a related problem?

What checking primality actually involves

The standard method for checking whether a number is prime is trial division: testing whether it’s evenly divisible by any integer from 2 up to its square root. You only need to check up to the square root because if a number has a factor larger than its square root, it must also have a corresponding factor smaller than the square root — so testing beyond that point is redundant.

For a number that isn’t prime, the smallest factor found during that trial division process is itself useful information — it tells you the number’s smallest prime factor immediately, which is often the first step in fully factoring it. Finding nearby primes just means continuing the same primality test on numbers just below and above your starting point until you’ve found enough.

Why people get stuck here

• Trial division by hand doesn’t scale. Checking a small number like 17 by hand is quick; checking something like 9,973 means testing divisibility against every prime up to about 99, which is a lot of manual arithmetic.
• The square root shortcut isn’t always obvious. Without knowing you only need to test up to the square root, people sometimes check divisibility all the way up to the number itself, which is unnecessary extra work.
• Finding nearby primes multiplies the effort. If you need several primes around a target number, you’re repeating the whole primality check multiple times.
• Off-by-one errors in factor finding. Manually tracking which divisors have been tested and which haven’t invites simple bookkeeping mistakes.

What a good prime number checker looks like

Gives an instant, correct primality result

The core check — is this number prime — should be immediate, regardless of how large the number is within a reasonable range.

Shows the smallest factor for non-primes

Rather than a flat “not prime,” showing the smallest factor gives you a useful starting point for further factoring.

Lists nearby primes automatically

Seeing the nearest primes below and above your number saves you from repeating the check manually for each candidate.

Common mistakes to avoid

• Testing divisibility all the way up to the number itself instead of stopping at its square root, wasting significant unnecessary effort.
• Forgetting that 1 is not considered prime by definition, and that 2 is the only even prime number.
• Assuming a large number “looks prime” based on intuition rather than actually verifying it — primality isn’t reliably guessable by inspection.
• Confusing “smallest factor” with “only factor” — a composite number can have several factors beyond just the smallest one.

How to do it with the Prime Number Checker

Online Tool Store’s Prime Number Checker checks primality instantly entirely in your browser.

1. Enter the number you want to check.
2. See immediately whether it’s prime.
3. If it’s not prime, see its smallest factor.
4. Check the five nearest primes below and above your number.

Because the check is instant, it’s practical to test several numbers in a row without repeating manual trial division each time.

Frequently asked questions

Is 1 a prime number?

No — by definition, a prime number has exactly two distinct positive divisors: 1 and itself. The number 1 has only one divisor (itself), so it’s specifically excluded from the definition of prime, even though this sometimes surprises people encountering the definition for the first time.

Why do you only need to check divisibility up to the square root?

If a number n has a factor larger than its square root, it must have a corresponding factor smaller than the square root (since their product equals n) — so any factor beyond the square root would already have been caught by testing its smaller counterpart. This cuts the amount of testing needed substantially for larger numbers.

What’s the difference between checking primality and fully factoring a number?

Checking primality just answers yes or no; factoring finds every prime factor and how many times each appears. Knowing the smallest factor of a non-prime number is a useful first step toward full factoring, but it’s not the complete factorization on its own.

Final thought

Primality checking is one of those tasks where the concept is simple but the manual execution doesn’t scale — instant verification means you can explore number theory curiosities without the tedium of trial division getting in the way.

Try the free Prime Number Checker