Prime numbers are simultaneously the simplest idea in mathematics, a number divisible only by 1 and itself, and the working heart of internet security, where the difficulty of splitting big numbers into primes protects every padlock icon in your browser. Between those extremes sits a set of very practical questions: how to test a number, how to factor it, why 91 fools everyone, and what divisor counts are good for. This guide answers them, with our free prime number calculator doing the heavy lifting on demand.
In this guide
What counts as prime, and why 1 does not
A prime has exactly two divisors: 1 and itself. The first few are 2, 3, 5, 7, 11, 13, and the sequence never ends, a fact Euclid proved with three lines twenty-three centuries ago. Two boundary cases carry the usual confusion. 2 is prime, the only even one, since every other even number divides by 2. 1 is not prime, by definition and for a reason: it has only one divisor, and admitting it would break the uniqueness of factorization below, since 6 could then be 2 × 3, or 1 × 2 × 3, or 1 × 1 × 2 × 3, forever. Excluding 1 is not pedantry; it is what keeps every number’s recipe unique.
Testing by hand: the square root shortcut
To check whether n is prime, you never need to try dividers all the way to n: if n has any divisor besides 1 and itself, one of them is at most √n, because divisors come in pairs that multiply to n, and a pair cannot both exceed the square root. So testing 97 means trying only the primes up to 9, namely 2, 3, 5 and 7; none divides 97, so 97 is prime, settled in four checks. The shortcut also names the most famous impostor: 91 looks prime to almost everyone, dodging the easy tests for 2, 3 and 5, and falls at the very next prime, 91 = 7 × 13. Numbers like 91 are why “it feels prime” is not a test and the calculator exists.
Factoring: every number’s unique recipe
Every integer above 1 is a product of primes in exactly one way, apart from ordering: 360 = 2³ × 3² × 5, and no other combination of primes multiplies to 360. This is the fundamental theorem of arithmetic, and “fundamental” is earned: it makes primes the atoms of the number system, with every other number a molecule built from them. The factorization is what the prime factor calculator produces, and it is the master key to the number’s behavior: simplifying fractions, finding least common denominators, and predicting divisibility all read straight off the recipe. The procedure by hand is humble, divide out small primes until nothing remains, which is also why it stops scaling: the recipe of a small number falls out in seconds, and the recipe of a 600-digit number is the hard wall the next section leans on.
From factors to divisors: the counting trick
How many divisors does 360 have? Listing them invites mistakes; the factorization answers instantly. Each divisor chooses how many of each prime to take: from 2³ × 3² × 5, a divisor takes zero to three 2s (four choices), zero to two 3s (three choices), zero or one 5 (two choices), so the count is 4 × 3 × 2 = 24 divisors, no listing required. The rule, add one to each exponent and multiply, explains at a glance why highly divisible numbers like 360, 720 and 5040 became the bases of degrees, minutes and dozens: their recipes are stacked with small primes, maximizing the choice product. The divisor finder lists the full set when you need the names and not just the count.
Why primes run your security
The asymmetry at the center of modern cryptography is one you have already met in this guide: multiplying two primes is trivial, recovering them from the product is not. Multiply two 300-digit primes and any laptop answers instantly; hand the 600-digit product to the world’s best algorithms and factoring it back is computationally hopeless at current scales. RSA encryption builds the public padlock from the product and keeps the primes as the private key, so the security of the connection rests on the factoring wall staying tall. It is a striking arrangement: the most practical technology of the internet age leans on the oldest unsolved difficulty in arithmetic, and every 91-style surprise in this guide is a tiny taste of why the wall holds. The rest of the math toolbox lives in the calculators hub.
Frequently asked questions
Is there a formula that generates all primes?
No usable one: primes resist every simple pattern, which is part of their charm and their cryptographic value. What exists are excellent tests for whether a given number is prime, and density results describing how often primes appear, on average, as numbers grow.
What are twin primes?
Pairs two apart, like 11 and 13 or 41 and 43. Whether infinitely many exist is a famous open problem; the pairs keep appearing as far as anyone has computed, and the proof keeps not arriving, a reminder that easy-to-state questions can be brutally hard.
Why is 2 considered prime when it feels like an exception?
It satisfies the definition exactly: divisors 1 and 2, nothing else. Its lonely evenness is just the fact that “even” means divisible by 2, so 2 is the only even number not disqualified by itself. No special pleading is involved.
How large are the biggest known primes?
Tens of millions of digits, found by distributed computing projects hunting a special family (Mersenne primes) where fast tests exist. Those giants are trophies rather than tools; the primes guarding your browser session are hundreds of digits, plenty for the factoring wall.