How to Tell If a Number Is Prime (Without Trying Every Divisor)

October 17, 2026 • NOFYI Editorial Team

A prime number is a whole number greater than 1 that has exactly two divisors: 1 and itself. That simple definition hides a surprisingly useful idea. Primes are the building blocks of all whole numbers, because every whole number greater than 1 can be broken down into a product of primes. They appear in school maths, in puzzles, in computer security, and in the way modern software protects passwords and messages. Yet many people still test for primality the slow way, by dividing by every number smaller than the candidate. That method works for tiny numbers, but it quickly becomes tedious and error-prone. There is a much better shortcut, and it is easy to learn.

This guide shows you how to tell whether a number is prime without trying every divisor. You will learn the definition in plain language, the square-root rule that saves most of the work, a clear step-by-step method you can use with pencil and paper, and a fully worked example for 97. You will also learn the common special cases, including 1, 2, even numbers, and multiples of small primes, plus the honest limitations of hand checking when numbers get large. By the end, you will be able to test ordinary numbers confidently and know exactly when to hand the job to a computer.

What Does Prime Really Mean?

Start with the definition, because most confusion comes from forgetting it. A prime number is a whole number greater than 1 whose only positive divisors are 1 and itself. For example, 2 is prime because its only divisors are 1 and 2. The number 3 is prime because its only divisors are 1 and 3. The number 5 is prime because its only divisors are 1 and 5. The number 7 is prime for the same reason. Each of these numbers cannot be split into smaller whole-number factors, except by using 1.

A composite number is a whole number greater than 1 that is not prime. It has at least one divisor besides 1 and itself. For example, 4 is composite because it can be written as 2 times 2. The number 6 is composite because it can be written as 2 times 3. The number 9 is composite because it can be written as 3 times 3. The number 15 is composite because it can be written as 3 times 5. Composite numbers can be broken down further, and that breakdown eventually leads to primes. The number 12, for example, is 2 times 2 times 3, and 2 and 3 are both prime.

Two special cases deserve attention. The number 1 is neither prime nor composite. It has only one positive divisor, itself, so it does not fit the definition of prime, which requires exactly two divisors. The number 0 is also neither prime nor composite in the usual sense, and negative numbers are not called prime in elementary school maths. Keeping 1 separate is important, because many mistakes in primality testing come from treating 1 as prime.

The Square-Root Shortcut: Why You Can Stop Early

Here is the key idea that makes hand testing practical. If a number n is composite, then it has a divisor that is less than or equal to the square root of n. Think about it this way. If n equals a times b, and both a and b are larger than the square root of n, then their product would be larger than n, which is impossible. So at least one factor must be less than or equal to the square root. That means you only need to test divisors up to the square root of n. If none of them divides n evenly, then n must be prime.

An example makes this concrete. Suppose you want to test 100. The square root of 100 is 10. You only need to test primes up to 10: 2, 3, 5, and 7. You do not need to test 11, 13, 20, 25, or 50, because any factor larger than 10 would have a matching partner smaller than 10. If you already checked the small factors, you have already covered the large ones. That logic saves a huge amount of work, especially as numbers get bigger.

You also only need to test prime divisors, not every whole number. If a number is divisible by 4, it is already divisible by 2. If it is divisible by 6, it is already divisible by 2 or 3. If it is divisible by 9, it is already divisible by 3. So testing the primes up to the square root is enough. This second shortcut combines with the first to make the method fast. For most numbers you meet in daily life, the list of divisors to test is very short.

How to Test a Number Step by Step

Use this method every time, in order, and you will rarely make a mistake. First, check the easy cases. If the number is less than 2, it is not prime. If the number is 2, it is prime. If the number is even and larger than 2, it is composite, because 2 divides it. If the number ends in 5 or 0 and is larger than 5, it is composite, because 5 divides it. If the digits add up to a multiple of 3 and the number is larger than 3, it is composite, because 3 divides it. These quick checks remove many candidates in seconds.

Second, find the square root. You do not need an exact square root. You need the smallest whole number whose square is greater than or equal to your number, or a close estimate. For example, the square root of 97 is between 9 and 10, because 9 times 9 is 81 and 10 times 10 is 100. So you only need to test primes up to 9. For 121, the square root is exactly 11. For 143, the square root is between 11 and 12, because 11 times 11 is 121 and 12 times 12 is 144. Rounding up is safe, because testing one extra prime does no harm.

Third, test each prime up to that square root, in order, by dividing. Work neatly and write down each division. If any prime divides the number with no remainder, stop: the number is composite. If none of them divides it evenly, the number is prime. Keep the list short and systematic. Do not skip a prime because it feels unlikely. The method only works if you test every prime up to the square root.

Fourth, record the result and, if the number is composite, note the factor you found. That note helps you check your work later and helps anyone reading your working to see why the answer is correct. For example, you might write that 91 is composite because 91 divided by 7 equals 13 with no remainder. That is much clearer than simply writing composite with no explanation.

Worked Example: Is 97 Prime?

Let us test 97 in full, because it is a classic example that shows every step. Start with the easy checks. The number 97 is greater than 2, it is not even, it does not end in 5 or 0, and its digits add to 16, which is not a multiple of 3. So none of the quick checks proves it composite. We need the main test.

Next, find the square root. We know 9 times 9 is 81 and 10 times 10 is 100. So the square root of 97 is between 9 and 10, just below 10. That means we only need to test primes up to 9. The primes up to 9 are 2, 3, 5, and 7. That is only four divisions, not 95 divisions. The square-root shortcut has already saved almost all the work.

Now test each prime in order. Test 2: 97 divided by 2 is 48 with a remainder of 1, so 2 does not divide 97. Test 3: 97 divided by 3 is 32 with a remainder of 1, because 3 times 32 is 96, so 3 does not divide 97. Test 5: 97 does not end in 0 or 5, so 5 does not divide it. You can also see that 5 times 19 is 95, leaving a remainder of 2. Test 7: 7 times 13 is 91, and 7 times 14 is 98, so 97 divided by 7 leaves a remainder of 6. None of the primes up to the square root divides 97 evenly.

Because no prime up to the square root divides 97, we conclude that 97 is prime. That conclusion is complete, not a guess. If 97 had a factor larger than 10, it would also have a factor smaller than 10, and we have already checked all the small prime factors. There is no hidden factor waiting beyond the square root. That is why the method is trustworthy.

For contrast, test 91 with the same method. The square root of 91 is between 9 and 10, so test 2, 3, 5, and 7. The number 91 is odd, its digits add to 10, and it does not end in 5, so 2, 3, and 5 fail. But 91 divided by 7 is exactly 13, because 7 times 13 is 91. So 91 is composite. Many people guess that 91 is prime because it looks prime, but the method catches the mistake. That is the value of a systematic test over intuition.

More Examples to Build Confidence

Try a few more numbers to see the pattern. The number 2 is prime. The number 3 is prime. The number 4 is composite because 2 times 2 is 4. The number 17 is prime, because the primes up to 4 are 2 and 3, and neither divides 17. The number 25 is composite because 5 times 5 is 25. The number 29 is prime, because the primes up to 5 are 2, 3, and 5, and none divides 29. The number 49 is composite because 7 times 7 is 49. The number 101 is prime, because the primes up to 10 are 2, 3, 5, and 7, and none divides 101.

It also helps to learn the first few primes by heart: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, and 47. Those primes cover the tests for most numbers up to about 2209, because the square root of 2209 is 47. If you know that list, you can test any number up to a few hundred with only a handful of divisions. You do not need to memorise a huge table. Just keep the early primes handy and work methodically.

Limitations: When Hand Checking Stops Being Practical

The square-root method is exact, but it is not always practical by hand. For a number with ten digits, the square root has five digits, and the number of primes to test becomes enormous. Even with a calculator, testing every prime up to that square root would take far too long for everyday use. Large numbers need computers, and modern cryptography uses numbers with hundreds of digits, far beyond what any person could test by hand.

Computers use smarter methods for large numbers. They combine quick divisibility checks, probabilistic tests that can say a number is very likely prime, and deterministic proofs for special cases. Those methods are beyond the scope of a pencil-and-paper guide, but it is useful to know that they exist. For school work, puzzles, and ordinary checks, the square-root method is enough. For security, banking, and encryption, professionals rely on tested software and well-reviewed algorithms, not on hand division.

Another limitation is human error. A single division mistake can change the answer. To reduce that risk, work in order, write each division down, and double-check any division that is close. If you find a factor, verify it by multiplying back. If you find no factor, re-check the square root to make sure you did not stop too early. A careful second pass is faster than defending a wrong answer.

Frequently Asked Questions

Is 1 a prime number? No. The number 1 is neither prime nor composite. A prime must have exactly two positive divisors, 1 and itself. The number 1 has only one positive divisor, so it does not qualify. This is a definition, not a trick, and it keeps the building-block idea consistent.

Why is 2 the only even prime? Every even number larger than 2 is divisible by 2, so it has at least three divisors: 1, 2, and itself. The number 2 is the exception because its only divisors are 1 and 2. That is why 2 is called the oddest prime, even though it is even.

Do I need to test every number up to the square root? No. You only need to test prime divisors up to the square root. If a composite divisor divided your number, one of its prime factors would also divide it, so testing primes is enough. That saves time and reduces the chance of error.

How do computers test very large primes? They use faster algorithms that avoid testing every prime up to the square root. Some tests give a very high probability that a number is prime, and others prove it with certainty for special forms. For everyday learning, the square-root method is the right tool. For cryptography, use trusted software and standard libraries rather than writing your own test.

Testing for primality does not have to mean trying every divisor. Remember the definition, use the quick checks, find the square root, test only the primes up to that point, and write your working down. For 97, that means checking only 2, 3, 5, and 7. When none divides evenly, 97 is prime. That method is simple, reliable, and fast enough for the numbers you will meet in ordinary life, and it tells you exactly when a number is large enough to hand to a computer.

Related tool: Prime Number Checker — free to use in your browser, no sign-up.