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