Two classifications for integers above one
A prime is an integer greater than one with exactly two positive factors, 1 and itself. A composite is an integer greater than one with more than two positive factors, equivalently a product of two smaller positive integers. Every integer greater than one belongs to exactly one of these classes. The definition concerns positive divisors even though negative divisors also exist.
The number 1 is a unit, not a prime and not a composite. It has only one positive factor. Zero is also neither; every nonzero integer divides zero, so it does not fit either factor count. Negative integers are outside the standard elementary classification, although their absolute values can have prime factorizations with an extra factor −1. These exclusions keep factorization statements unique.
Factor pairs reveal compositeness
Factor pairs multiply to the target. For 12 they are 1×12, 2×6, and 3×4, so 12 is composite. For 13, only 1×13 exists among positive integers, so 13 is prime. Pairs mirror around the square root, which explains why classification tests do not need to search beyond that point.
A perfect square has an unpaired middle factor in the factor list: 49=7×7. Every perfect square greater than one is composite because its square root is a nontrivial factor. The number 1 is the exceptional square 1² but remains a unit by definition. Recognizing squares prevents the mistake of checking divisors only strictly below √n.
Even, odd, prime, and composite
Two is the only even prime. Any even integer greater than two has factor 2 and is composite. Odd does not mean prime: 9, 15, 21, 25, 35, and 91 are odd composites. Parity is only a fast first filter. Likewise, a number ending in 5 is composite when greater than 5, but other final digits do not prove primality.
Input: 29. Rule: classification depends on positive factor structure. Steps: possible small factor pairs through √29 use divisors 2,3,5; none divides. Result: 29 is prime. Verification: its positive factors are 1 and 29. Input: 35. Steps: 5 divides it. Result: composite. Verification: 35=5×7, in addition to 1×35.
Classifying special values
Input: 0 and 1. Rule: prime and composite categories apply only to integers greater than one. Steps: 0 has many divisors and 1 has one positive divisor. Result: both are neither prime nor composite. Verification: neither satisfies the exactly-two or greater-than-two finite factor definition for integers above one.
Input: 2, 3, and 4. Rule: count positive factors. Steps: 2 has {1,2}; 3 has {1,3}; 4 has {1,2,4}. Result: 2 and 3 are prime, while 4 is composite. Verification: 4=2². Input: −7. Rule: negative integers are outside this elementary classification. Result: neither; its absolute value 7 is prime, but that does not make −7 a prime in this convention.
More classification examples
Input: 91. Rule: one nontrivial factor pair proves composite. Steps: 91÷7=13. Result: composite. Verification: 7×13=91. Input: 97. Rule: if no possible prime divisor through √97 divides, the number is prime. Steps: 2,3,5,7 all fail. Result: prime. Verification: these exhaust the necessary factor candidates.
Input: 121. Rule: a perfect square above one is composite. Steps: identify 11². Result: composite. Verification: factor pair 11×11. These cases show why visual impressions fail: 91 and 121 are odd but composite, while 97 is odd and prime. Classification must rest on factors, not size, oddness, or an unfamiliar appearance.
Prime factorization in the background
The Fundamental Theorem of Arithmetic says every integer greater than one is either prime or can be expressed as a product of primes uniquely apart from order. A prime is already its own prime factorization; a composite breaks into at least two prime factors when multiplicity is counted. For example, 84=2²×3×7. This structure supports fraction reduction, GCF, and LCM methods.
The theorem does not classify 1 as prime. If 1 were prime, arbitrary extra factors of 1 would destroy uniqueness: 6 could be 2×3, 1×2×3, and so on. Calling 1 a unit preserves a clean boundary. This page uses the theorem only as context; the GCF and LCM guides explain their own calculations, and the prime-checking pillar explains efficient testing rather than full factorization.
What the Prime Number Checker reports
Enter a nonnegative whole number through 18,446,744,073,709,551,615. The tool reports prime, composite, or not prime for values below two. It may show a small factor for a composite, but factor display is limited and absence of a displayed factor does not mean the result is uncertain. The classification itself is deterministic throughout the accepted unsigned 64-bit range.
The checker rejects negatives, decimals, separators, and larger integers. It does not generate cryptographic primes or fully factor every composite. Use it to verify classification examples after reasoning about the definition and obvious factors. For detailed trial division, the square-root bound, and the implementation's Miller–Rabin distinction, continue to How to Check Whether a Number Is Prime. For shared factors across several positive integers, use the GCF Calculator instead.
Building and reading a factor table
For small positive integers, list factor pairs until the first factor exceeds its partner. The factor pairs of 36 are 1×36, 2×18, 3×12, 4×9, and 6×6. Reversed pairs add no new divisors. A prime row contains only 1×n; a composite row contains another pair. The middle square pair explains why a perfect square has an odd number of positive divisors, while nonsquares have divisors paired distinctly.
A useful classification table needs a third outcome, “neither,” for 0 and 1 rather than forcing them into prime or composite columns. If negatives are included, state the chosen domain and classify them outside the elementary prime/composite definition used here. Saying only “not prime” is incomplete because it could mean composite, a unit, zero, a negative value, or even a noninteger input. Precise categories support later work with factorization and divisibility.
Prime and composite describe structure, not importance or size. There are arbitrarily large primes and composites, and nearby numbers can fall in different categories. A composite may have only two distinct prime factors or many repeated ones. A prime has no nontrivial factor pair, but that fact alone does not tell whether it is appropriate for encryption, hashing, or any applied system. Keep this page's educational classification separate from specialized security requirements.
Factor multiplicity matters in prime factorization. Twelve is 2×2×3, not merely the set 2 and 3; the repeated factor explains divisors such as 4. A prime appears once as itself, while a composite has a product with at least two prime factors when multiplicity is counted. These facts support later GCF and LCM calculations, but classification itself requires only deciding whether a nontrivial factor exists. Full factorization can be substantially harder than proving that a large number is composite. That difference explains why a checker may confidently label a value composite without listing all of its complete prime factors in the result.