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