Is 91 Prime? How to Find a Number's Prime Factors by Hand (and When to Let a Tool Do It)
91 looks prime — it's odd, doesn't end in 0 or 5, and isn't obviously divisible by 3. It isn't. Here's the actual method for testing primality and finding prime factors, why it breaks down for large numbers, and where a calculator earns its keep.
Quick answerA number is prime only if its sole positive divisors are 1 and itself. To check, divide it by every whole number from 2 up to its square root — not just 3, 5, and 7. 91's square root is about 9.5, and 91 ÷ 7 = 13 exactly, so 91 is not prime: it's 7 × 13.
The mistake people make with a number like 91 is stopping the check too early. It fails the obvious tests — not even, doesn't end in 5, digit sum (10) isn't divisible by 3 — so it's tempting to call it prime and move on. But the divisibility rules for 2, 3, and 5 only rule out the most common small factors; they say nothing about 7, 11, or 13. A correct primality check has to try every candidate divisor up to the square root of the number, because if a number has a factor larger than its square root, it must also have a matching factor smaller than its square root.
Rule of thumb: you only need to test divisors up to √n. If nothing up to and including √n divides evenly, n is prime — you never need to check further.
For small numbers this trial division is easy to do by hand or in your head. For anything past a few digits, it gets tedious fast, which is exactly the kind of check a prime factorization calculator is built for — type in the number and it runs through the divisibility check (or a faster method for larger inputs) instantly.
Breaking a number into prime factors
Quick answerDivide the number by the smallest prime that fits (starting with 2), repeat with the same prime until it no longer divides evenly, then move to the next prime. Keep going until what's left is 1. Write the result with exponents — for example, 360 = 2³ × 3² × 5.
This process — dividing out one prime at a time, smallest first — always produces the same set of prime factors for a given number, in the same multiplicities, no matter what order you happen to try the primes in. That's the fundamental theorem of arithmetic: every integer greater than 1 has exactly one prime factorization. It's why "factor 360" always has one correct answer, not several.
Example numbers and their prime factorization
Number
Prime?
Factorization
91
No
7 × 13
100
No
2² × 5²
360
No
2³ × 3² × 5
97
Yes
97 (prime)
1,001
No
7 × 11 × 13
Take a practical case: say you're splitting a value of 360 units evenly across teams and want to know every group size that divides it cleanly. Once you know 360 = 2³ × 3² × 5, you can read off the full divisor list — 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, ... up to 360 itself — by combining the exponents, instead of testing every number from 1 to 360 one at a time. The calculator's "Show divisor list" option does exactly this after it factors your input.
Why trial division stops working for big numbers
Quick answerTrial division is fine up to roughly a few million, but its cost grows with the square root of the number, so an 18-digit number could need checking billions of candidate divisors. Large-number primality tests instead use algorithms like Miller-Rabin, which can confirm primality (or find it's composite) in a small, fixed number of steps regardless of how many digits the number has.
Miller-Rabin isn't a guessing game bolted onto trial division — for numbers up to 18 digits, testing against a known, fixed set of witness values makes the result mathematically certain, not just likely. Beyond that range, the same test run with many random witnesses instead becomes probabilistic: still extremely reliable (a wrong answer is astronomically unlikely), but not provably certain the way the deterministic version is. That distinction — certain versus high-confidence probabilistic — matters if you're working with genuinely large numbers, such as testing a 40 or 80-digit candidate, rather than everyday inputs.
Factoring large composite numbers has the same problem in reverse: trial division to find factors of a large number can take far too long, so faster methods like Pollard's rho algorithm are used to locate factors with much less brute-force searching.
Prime, factored, and coprime aren't the same thing
Quick answerTwo numbers are coprime if their only shared divisor is 1 — found by computing their greatest common divisor (GCD) — regardless of whether either number is itself prime.
Example: 8 (= 2³) and 15 (= 3 × 5) share no prime factors at all, so they're coprime, even though neither 8 nor 15 is a prime number on its own. Compare that to 12 and 18, which both contain 2 and 3 as factors — not coprime, GCD = 6.
This distinction shows up in practical contexts like simplifying fractions (a fraction is fully reduced only when its numerator and denominator are coprime) or scheduling problems (two repeating cycles interact differently depending on whether their lengths are coprime). Testing it by hand means finding the prime factorization of both numbers and checking for any prime in common — or just computing the GCD directly, which is what the "Are they coprime?" mode does in one step.
Related range-based question: listing every prime between two bounds (say, all primes from 1 to 1,000) is a different task from testing one number — it uses the Sieve of Eratosthenes, which eliminates multiples of each prime in batches rather than testing numbers individually, making it far faster than running a primality test on each candidate in the range one by one.
Test primality, factor a number, scan a prime range, or check if two numbers are coprime — all free and instant.
No — 91 is not prime. It factors as 7 × 13, so it has divisors other than 1 and itself. It's a common example precisely because it looks prime at a glance (it's odd, doesn't end in 5, isn't divisible by 3) but trips people up who stop checking too early. Trial division up to its square root (about 9.5) catches it once you try 7.
What is the fastest way to check if a number is prime?
For small numbers (up to a few million), trial division up to the square root is fast enough to do by hand or with a basic script. For large numbers — 15, 18, or even 100 digits — trial division becomes impractically slow, and a Miller-Rabin primality test is used instead, which can give a certain answer for numbers up to 18 digits and a very-high-confidence probabilistic answer beyond that.
How do you write a prime factorization in exponential form?
Once you've found all the prime factors by repeated division, group repeated primes using exponents. For example, if you divide 360 by 2 three times and by 3 twice before reaching 5, you write it as 360 = 2³ × 3² × 5 rather than 2 × 2 × 2 × 3 × 3 × 5. This is the standard, unique form guaranteed by the fundamental theorem of arithmetic.
Why do two numbers not need to be prime to be coprime?
Coprime only means the greatest common divisor (GCD) of the two numbers is 1 — that they share no common factor besides 1. Neither number has to be prime itself. For example, 8 (= 2³) and 15 (= 3 × 5) are coprime because they share no prime factors, even though both are composite.
What's a quick way to list every prime number in a range without checking each one by hand?
The Sieve of Eratosthenes is the standard method: starting from 2, cross out every multiple of each prime you find, and whatever numbers remain unmarked are prime. It's far faster than testing each number individually because it eliminates composites in batches rather than one at a time.
Note: The example numbers and scenarios in this guide (team sizes, fraction reduction, etc.) are illustrative, not records of any real case. This article is for general educational purposes and isn't a substitute for a math course or formal reference — always verify results for anything you depend on with a second method or source.