Every whole number greater than 1 is either prime or can be written as a product of primes in exactly one way. That idea — the fundamental theorem of arithmetic — quietly protects much of the internet.
A small example: 17381
17381 = 7 × 13 × 191. Multiplying those three primes takes seconds by hand. Going the other way — starting from 17381 and finding the primes — takes more work: you test divisors one by one. Our Number Analyzer does it instantly for numbers this size, because a computer can try every divisor up to √17381 ≈ 132 in microseconds.
Scale changes everything
Now imagine two primes each hundreds of digits long. Multiplying them is still fast. Factoring their product with known classical algorithms would take an impractical amount of time. That one-way asymmetry is the heart of RSA encryption, used for decades to secure websites, email and payments.
Public key, private key
In RSA, the big product is part of the public key — anyone can use it to encrypt a message. Only someone who knows the original prime factors can compute the private key needed to decrypt. Break the factorisation and you break the lock.
What about quantum computers?
Shor's algorithm shows that a sufficiently large, error-corrected quantum computer could factor such numbers efficiently. That is why standards bodies have been publishing and rolling out post-quantum cryptography designed to resist quantum attacks.
Try it yourself
- Enter any number in the Number Analyzer to see its prime factorisation.
- Notice how quickly factors appear for small numbers — and imagine 600 digits.
Want a human to sanity-check your numbers?
Get a free 1-page Numbers Check-up: margin, break-even, runway and the one number to fix first.
This guide is general information, not financial, tax or legal advice. See our disclaimer.