The prime number tools tell you whether a number is prime, break it into prime factors, count its divisors and find the nearest primes on either side. A second tool lists every prime in a range. It uses fast modern algorithms, so even 30- or 40-digit numbers are checked and factored in an instant, right in your browser.
| Up to | Number of primes |
|---|---|
| 10 | 4 |
| 100 | 25 |
| 1,000 | 168 |
| 10,000 | 1,229 |
| 1,000,000 | 78,498 |
No. A prime has exactly two divisors, 1 and itself; 1 has only one.
Divide by the smallest prime that fits, repeat with the result, and collect the primes. The tool shows the result instantly.
Up to 40 digits.
25.
No. It runs in your browser.
Primality is tested with the Miller–Rabin test using the first 13 primes as witnesses, which is proven deterministic for every number below about 3.3 × 10²⁴ and overwhelmingly reliable beyond. Factorization first divides out small primes, then splits the remaining composite parts with Pollard's rho algorithm and tests each piece with Miller–Rabin, so numbers with large prime factors (like the product of two 10-digit primes) factor in moments instead of years of trial division. The number of divisors comes from the exponents: (e₁ + 1)(e₂ + 1)…. The previous and next primes are found by testing neighbors. Primes in a range are generated with a segmented Sieve of Eratosthenes, which only needs primes up to the square root of the upper limit, for ranges of up to a million numbers below 10¹².