
Published: 16 November 2026 Β· Updated: 16 November 2026
Test any whole number for primality, see its factorization and divisors, and list every prime up to 100,000. It starts with 97, which is prime. Free, no sign-up.
A prime has exactly two divisors: 1 and itself. Enter any whole number to test it, see what divides it, and find the primes nearest to it β then generate the full prime list up to any limit.
Researched by MixKhazana Team · Last updated 16 November 2026 · Data: standard trial-division and sieve methods; Maths is Fun reference pages
A prime number is a whole number greater than 1 whose only divisors are 1 and itself: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 and so on. A whole number greater than 1 that is not prime is composite: it can be written as a product of smaller whole numbers. Every composite number has exactly one prime factorization (the fundamental theorem of arithmetic) β 60 is always 2Β² Γ 3 Γ 5, in no other way.
Trial division: to test n, try dividing by every prime up to βn. If none divides n, n is prime β because any divisor larger than βn would pair with a divisor smaller than βn, which would already have been found. Checking only up to the square root is what makes the test fast: testing 97 needs only divisors up to 9.85. Sieve of Eratosthenes: to list primes up to N, write all numbers, cross out multiples of each prime in turn, and what remains is prime.
Is 97 prime?
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97. Note that 2 is the only even prime β every other even number is divisible by 2 and therefore composite. There are 25 primes below 100, 168 below 1,000, and 9,592 below 100,000.
Primes are the atoms of arithmetic: every whole number is built from them uniquely. They also secure the internet β RSA encryption, which protects most web traffic, multiplies two huge primes together; the product is public, but recovering the original primes from it is practically impossible. Euclid proved over 2,000 years ago that there are infinitely many primes, and the search for ever-larger ones continues through the Great Internet Mersenne Prime Search (GIMPS).
No. A prime must have exactly two divisors, 1 and itself. 1 has only one divisor, itself, so it is classed as neither prime nor composite. This keeps prime factorization unique: if 1 were prime, 6 could be 2 x 3, 1 x 2 x 3, 1 x 1 x 2 x 3, and so on.
Yes, and it is the only even prime. Every other even number is divisible by 2, so it has a divisor besides 1 and itself and is composite. 2 is also the smallest prime.
No. 0 is divisible by every number, so it has far more than two divisors. Like 1, it is neither prime nor composite.
Trial division up to the square root: try dividing by primes up to sqrt(n). If none divides n, it is prime. This tool checks numbers up to 10 to the power 12 that way. For far larger numbers, mathematicians use probabilistic tests such as Miller-Rabin.
Yes. Euclid proved it around 300 BC: given any finite list of primes, multiplying them all and adding 1 gives a number that is not divisible by any prime on the list, so a new prime must exist beyond it.
Pairs of primes that differ by 2, such as 11 and 13, 17 and 19, or 29 and 31. Whether infinitely many twin primes exist is an unsolved problem in mathematics, though most mathematicians believe there are.
Record primes are almost always Mersenne primes, of the form 2 to the power p minus 1, found by the GIMPS distributed-computing project. New records appear every few years, each with millions of digits; the current record is published on mersenne.org.
Because 91 has no small obvious divisor: it is odd, its digits sum to 10 (not a multiple of 3), and it does not end in 5. But 91 = 7 x 13. Any number that survives the easy divisibility tests can still be composite, which is why checking up to the square root matters.
Disclaimer: a study aid for school and college number theory. Primality results are exact for whole-number inputs within the stated limits.
Card photos: Yulia Meshkova / Wikimedia Commons, CC BY 4.0 Β· cottonbro studio / Pexels, Pexels licence Β· Joost J. Bakker / Wikimedia Commons, CC BY 2.0 Β· Vyacheslav Argenberg / Wikimedia Commons, CC BY 4.0