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