This prime calculator combines three related tasks that are often confused: checking whether an integer is prime, factoring an integer into prime factors, and listing every prime in a closed interval. Each mode has its own supporting output: prime check shows the smallest factor, neighboring primes, and factorization; factor mode shows exponents and the total number of positive divisors; range mode returns the complete list and count.
It is useful for classroom practice, introductory number theory, programming checks, factor analysis before fraction reduction, and moderate-size prime lookups. If you need to use prime factors for a greatest common factor or least common multiple, see the GCF calculator and LCM calculator. For fraction arithmetic, use the fraction calculator.
97 is prime or find a composite number's smallest prime factor.84 as 2^2 × 3 × 7.10 through 30.The page provides three modes:
Prime Check (check) tests an integer and shows its smallest factor, neighboring primes, and factorization.Factorization (factor) factors one integer and shows each prime exponent plus the positive divisor count.Prime Range (range) lists every prime from the start value through the end value, including both endpoints.It supports prime checking, prime factorization, and listing primes in a range.
Enter an integer greater than or equal to 2. Decimals, fractions, comma-formatted numbers, scientific notation, and unit text do not match the current input rules.
Yes. The page scans the closed interval from start through end; values below 2 are checked but never appear in the prime list.
Start and end must be integers, end cannot be smaller than start, and the difference between the endpoints cannot exceed 100000.
If n = p₁^a₁ × p₂^a₂ × …, the number of positive divisors is (a₁+1)(a₂+1)×…; the page derives it from the factorization.
Check primality, factor integers, count positive divisors, find neighboring primes, and list primes in an inclusive range.