Step-by-Step Proof: Why 289 Is Not Prime
- 1
Compute the square-root bound: ⌊√289⌋ = 17. If 289 is composite, at least one prime ≤ 17 must divide it.
- 2
Testing primes in ascending order immediately finds a witness divisor: 289 ÷ 17 = 17 with remainder 0.
- 3
Since 17 divides 289 evenly (1 < 17 < 289), 289 has more than two positive divisors (3 in total) and its complete prime factorization is 289 = 17².
Prime Factorization & All Factors of 289
Open 289 in Visual Factor Tree →289 has 3 positive divisors with divisor sum σ(289) = 307 and aliquot sum s(289) = 18 (Deficient number).
Division Ladder
Mathematical Properties & Number Bases of 289
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 289
Is 289 a prime number or a composite number?
No, 289 is not a prime number. It is a composite number divisible by 17 (289 = 17 × 17), with prime factorization 17².
What are all the positive factors (divisors) of 289?
The 3 positive divisors of 289 are: 1, 17, 289. Their sum is σ(289) = 307.
What is the prime factorization of 289?
The prime factorization of 289 is 17² (17^2).
What are the closest prime numbers before and after 289?
The previous prime before 289 is 283, and the next prime after 289 is 293.
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.