Check if a number is prime, list factors, and find the next prime. Fast trial-division up to billions. 100% private. 100% free, private, and browser-based.
A prime is a whole number greater than 1 that has no positive divisors other than 1 and itself. The first primes are 2, 3, 5, 7, 11, 13.
We use trial division up to sqrt(n), which handles numbers into the billions in a few milliseconds.
No. By modern convention, primes must be greater than 1. The number 1 is called a unit.
Numbers up to about 9×10^15 work but slow down. For cryptographic-sized primes, use a dedicated math library.
No — by modern convention, primes start at 2.
There is no largest. The largest known is a Mersenne prime with ~24.8 million digits.
Microseconds for normal integers, milliseconds even for cryptographic sizes.
With 40 rounds the false-prime rate is below 1 in 10²⁴ — used in real RSA libraries.
No — runs entirely in your browser.
Quickly determine whether a number is prime, list its prime factorisation, and find the next prime number after it. Works on integers up to several billion.
Primality is tested with trial division by 2 and odd numbers up to the square root of the input. The same loop is reused to extract prime factors. The next-prime finder simply increments until primality holds.
All math runs in your browser. The number is never sent to a server.
Related: Scientific Calculator, GCD & LCM Calculator, Random Number Generator.
Browse all free tools · Guides and tutorials · PDF tools · Developer tools · Text tools · SEO tools