What Are Prime Numbers and Why Are They So Important?

Take the number 60. Split it into two smaller numbers, any way you like, say 6 and 10. Now split those. 6 becomes 2 and 3. 10 becomes 2 and 5. You're left with 2, 3, 2, 5.

Start over. This time split 60 into 4 and 15. Then 4 becomes 2 and 2. And 15 becomes 3 and 5. You're left with 2, 2, 3, 5.

Same four numbers. Every time, no matter which path you take.

That's not a coincidence. It's the whole reason primes matter: they're the fixed, unbreakable ingredients that every other number is built from.

What actually makes a number "prime"?

Picture 12 dots. You can arrange them into a neat rectangle a bunch of different ways: 1 row of 12, 2 rows of 6, 3 rows of 4. Plenty of options.

Now picture 13 dots. Try to arrange them into a rectangle. You can't, not without one long row of 13 and a single column. That's it. That's the only option.

Numbers like 13 are stubborn. They refuse to be arranged into anything but a single line. We call these numbers prime. Numbers like 12, the ones with multiple rectangle options, we call composite.

We write it like this: a number $p$ is prime if its only positive divisors are $1$ and $p$ itself. Every other number greater than 1 is composite, meaning it can be written as a product of smaller numbers.

Notice something else: 1 doesn't count as prime. It only has one divisor, itself, so it doesn't even get a rectangle option to fail at. Mathematicians just carve it out as its own special case.

Every number is a unique recipe of primes

So what happens when you keep splitting a composite number, over and over, until every piece left is prime? You get its prime factorization, the unique bag of prime "atoms" that number is made of.

And here's the thing that surprised mathematicians enough to name it: it doesn't matter which order you split in. Split the big number first, split the small one first, doesn't matter. You always land on the same atoms.

Drag the slider to pick a different number, then hit "split a different way" a few times. Watch the tree take a completely different shape. The leaves never change.

This idea has a name: the Fundamental Theorem of Arithmetic. Every whole number greater than 1 is either prime, or breaks down into exactly one combination of primes, ignoring the order you write them in. We write a factorization like this:

Think of primes as chemical elements and composite numbers as molecules. Water is always two hydrogen atoms and one oxygen atom, however you synthesize it. 60 is always two 2's, one 3, and one 5, however you split it apart. Primes are the periodic table of arithmetic.

So how do we actually find primes?

Here's a puzzle: given a big pile of numbers, how do you sort out which ones are prime without testing every single divisor of every single number by hand?

Around 200 BC, a mathematician named Eratosthenes came up with a shortcut. Write down every number up to some limit. Cross out every multiple of 2 except 2 itself. Then every multiple of 3 except 3. Then 5. Keep going. Whatever survives, never got crossed out, must be prime.

It works because a composite number always has a smaller prime factor that catches it first. You never have to check a number directly, you just let its factors take it out.

Hit play and watch it happen. Notice how the crossing-off speeds up early (multiples of 2 are everywhere) and slows down later (there's less left to cross out). By the time the tester passes $\sqrt{n}$, everything remaining is automatically prime, because any composite number smaller than the limit would have to have a factor at or below its own square root.

This 2,200-year-old trick, the Sieve of Eratosthenes, is still one of the fastest ways to list primes today.

Do primes follow a pattern?

Here's where it gets strange. You'd think something this fundamental would show up on a schedule. It doesn't.

Early on, primes are packed close together: 2, 3, 5, 7, 11, 13... Gaps of 1 or 2. But scan further out and the gaps stretch. Sometimes you'll go dozens of numbers without hitting a single prime. Then, out of nowhere, you'll find two primes sitting right next to each other again, just 2 apart, way out where you'd expect them to be rare.

Slide through the number line, or drag it directly. Watch the gap sizes above each pair. They grow on average, primes really do thin out, but never smoothly. Hit "jump to a bigger gap" and you'll land on a genuine prime desert, a long stretch with nothing prime in it at all.

Those close pairs, primes exactly 2 apart, are called twin primes. Mathematicians have found enormous ones, and strongly suspect there are infinitely many. Nobody has ever proven it. It's called the Twin Prime Conjecture, and it's one of the oldest unsolved problems in all of math.

Why does any of this actually matter?

So primes are the atoms of arithmetic, and they're scattered unpredictably. Interesting, sure. But here's the payoff: that same unpredictability is what keeps your online banking safe.

Multiplying two primes together is trivial. Give a computer $p$ and $q$, it spits out $p \times q$ instantly, no matter how large they are. But hand that computer only the product, $n = p \times q$, and ask it to work backward to find $p$ and $q$... that's a completely different problem. There's no shortcut. The best general approach is still, essentially, guessing and checking candidates up to $\sqrt{n}$.

Slide toward bigger primes and hit "try to factor". Multiplication stays instant the whole way. Factoring doesn't. Watch the estimated time explode from milliseconds to days, from a pair of 15-digit primes alone. Real encryption systems, like RSA, use primes hundreds of digits long. At that size, even the fastest computers on Earth, running the best known factoring algorithms, would need longer than the universe has existed.

That one-way street, easy to multiply, brutally hard to un-multiply, is the lock on almost every secure connection on the internet.

The short version

Primes are the numbers that refuse to be split into smaller factors. Every other whole number breaks down into exactly one combination of them, no matter how you split it apart, which makes primes the fixed building blocks of arithmetic itself. We find them by elimination, using a trick that's over two thousand years old. They're scattered unpredictably along the number line, thinning out but never settling into a pattern. And because multiplying primes together is easy while reversing that process is punishingly hard, they've become the foundation of how we keep information secret online.

A number as ordinary as 60 hides an unbreakable recipe. A number 300 digits long hides your bank password.

All visualizations are interactive React components running entirely in your browser, using SVG and native BigInt for the large-number arithmetic in the factoring race. No libraries beyond React.