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