Step-by-Step Proof: Why 221 Is Not Prime
- 1
Compute the square-root bound: ⌊√221⌋ = 14. If 221 is composite, at least one prime ≤ 14 must divide it.
- 2
Testing primes in ascending order immediately finds a witness divisor: 221 ÷ 13 = 17 with remainder 0.
- 3
Since 13 divides 221 evenly (1 < 13 < 221), 221 has more than two positive divisors (4 in total) and its complete prime factorization is 221 = 13 × 17.
Prime Factorization & All Factors of 221
Open 221 in Visual Factor Tree →221 has 4 positive divisors with divisor sum σ(221) = 252 and aliquot sum s(221) = 31 (Deficient number).
Division Ladder
Mathematical Properties & Number Bases of 221
Test Another Number Instantly
Enter any integer (including 100+ digit BigInt numbers) to test primality in our full Prime Number Checker.
Frequently Asked Questions About 221
Is 221 a prime number or a composite number?
No, 221 is not a prime number. It is a composite number divisible by 13 (221 = 13 × 17), with prime factorization 13 × 17.
What are all the positive factors (divisors) of 221?
The 4 positive divisors of 221 are: 1, 13, 17, 221. Their sum is σ(221) = 252.
What is the prime factorization of 221?
The prime factorization of 221 is 13 × 17 (13 × 17).
What are the closest prime numbers before and after 221?
The previous prime before 221 is 211, and the next prime after 221 is 223.
Prime Number Tools & Reference Guides
Explore dedicated charts, visual factor trees, range generators, and step-by-step proofs for commonly searched numbers.
Prime Number Checker
Instantly test primality for any integer (including 100+ digit BigInt numbers), find factors, and jump to neighbor primes.
Prime Numbers Chart (1 to 1000)
Interactive 1–100 highlighted prime grid, complete list of all 168 primes up to 1,000, twin primes, and Mersenne primes.
Prime Factorization & Factor Tree
Break any integer into prime factors with a visual SVG factor tree, division ladder, exponential form, and full divisor list.
Prime Number Generator & N-th Prime
Generate prime sequences up to 1,000,000 using Sieve of Eratosthenes, find the N-th prime, or create random primes & CSV exports.