Check whether a number is prime, and see its smallest prime factor if it isn't.
📖 Trial Division Primality TestFill in the fields on the left with your information, then press Calculate to see your result instantly. No sign-up required, and no data is sent anywhere — everything is calculated right in your browser.
The prime number checker examines whether a given integer is a "prime number" — any number greater than 1 divisible only by itself and 1 — or a "composite number" with other factors. The calculator works using "trial division," where the entered number is divided by every number from 2 up to its square root only, because any factor larger than the square root must be paired with another factor smaller than it — so if no factor is found within this limited range, the number is definitely prime. This optimization makes the check very fast even for relatively large numbers. If the number isn't prime, the calculator displays the smallest prime factor that divides it. Prime numbers are the foundation of modern number theory, and are widely used in cryptography and information security. The number 2 holds a special distinction as the only even prime number, since every other even number is automatically divisible by 2 and therefore composite by definition.
Checking whether a number is prime by testing every possible divisor up to the number itself would work correctly, but it would also be dramatically slower than necessary — the trial-division-up-to-the-square-root optimization used by this calculator cuts that workload down enormously, and the mathematical reason it works is worth understanding rather than simply accepting as a rule.
Every factor of a composite number pairs with a complementary factor whose product equals the original number. If a number n has a factor larger than its square root, that factor's paired complementary factor must necessarily be smaller than the square root — because if both factors in the pair were larger than the square root, their product would exceed n itself, which is a contradiction. This means that if no factor exists anywhere up to and including the square root, no factor can exist above it either, and the number must be prime.
This single insight roughly squares the speed of a primality check for large numbers: checking a number near one million for factors up to one million would require up to a million division tests in the worst case, but checking only up to its square root (about 1,000) reduces that same worst case to roughly a thousand tests — a dramatic practical difference that becomes even more pronounced for much larger numbers.
The number 2 deserves specific mention as the only even prime number, a fact that surprises some people encountering it for the first time. Every even number greater than 2 is automatically divisible by 2, satisfying the definition of a composite number (having a factor other than 1 and itself) immediately — which is exactly why 2 is prime while no other even number ever can be.
Prime numbers underlie the security of much of the modern encrypted internet, particularly through cryptographic schemes that rely on the practical difficulty of factoring the product of two very large primes back into its original factors, even though multiplying those same two primes together in the first place is computationally easy. This asymmetry — easy in one direction, extremely hard in the other for sufficiently large numbers — is the mathematical basis securing everything from online banking to encrypted messaging.
If a number has a factor larger than its square root, it must also have a matching factor smaller than the square root, so checking beyond that point is unnecessary.
No, by definition 1 is excluded from both prime and composite numbers since primality requires exactly two distinct positive divisors.
Yes, every other even number is divisible by 2 in addition to itself and 1, which disqualifies it from being prime.