Prime Number Checker & Generator

BigInt Support Miller-Rabin Sieve of Eratosthenes Goldbach Twin Primes Free

Check if any number is prime (BigInt Miller-Rabin), generate primes via Sieve of Eratosthenes, factorize into prime factors, find the Nth prime, locate the nearest prime, test Goldbach’s conjecture, check coprimality, highlight twin primes, and visualize prime gaps and density. All runs in your browser.

Prime Number Tools



&
Algorithms ▼
  • Primality: Deterministic Miller-Rabin for 64-bit; probabilistic for BigInt.
  • Sieve: Eratosthenes up-to-N; segmented for ranges.
  • Factorization: Trial division, 6k±1 optimization.
  • Nth prime: PNT upper bound n(ln n + ln ln n).
  • Goldbach: Sieve-based scan.
  • GCD: Euclidean algorithm (BigInt).
Result

Support This Free Tool

Every coffee helps keep the servers running. Every book sale funds the next tool I'm dreaming up. You're not just supporting a site — you're helping me build what developers actually need.

500K+ users
200+ tools
100% private
Privacy Guarantee: Private keys you enter or generate are never stored on our servers. All tools are served over HTTPS.