Divisors of 16650: All 36 Factors

Quick Answer

16650 has 36 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 37, 45, 50, 74, 75, 90, 111, 150, 185, 222, 225, 333, 370, 450, 555, 666, 925, 1110, 1665, 1850, 2775, 3330, 5550, 8325, 16650.

Sum: 45942.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 37, 45, 50, 74, 75, 90, 111, 150, 185, 222, 225, 333, 370, 450, 555, 666, 925, 1110, 1665, 1850, 2775, 3330, 5550, 8325, 16650

Use the calculator above to find all divisors (also called factors) of any positive integer up to 4,782,969. Beyond the divisor list, this tool also shows divisor pairs, the sum and count of divisors, prime factorization, and number properties (prime, perfect square, perfect number).

All Divisors of 16650

The number 16650 has 36 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  25,  30,  37,  45,  50,  74,  75,  90,  111,  150,  185,  222,  225,  333,  370,  450,  555,  666,  925,  1110,  1665,  1850,  2775,  3330,  5550,  8325,  16650

Divisor Pairs of 16650

Each pair multiplies to 16650:

Factor 1×Factor 2=Product
1×16650=16650
2×8325=16650
3×5550=16650
5×3330=16650
6×2775=16650
9×1850=16650
10×1665=16650
15×1110=16650
18×925=16650
25×666=16650
30×555=16650
37×450=16650
45×370=16650
50×333=16650
74×225=16650
75×222=16650
90×185=16650
111×150=16650

Number of Divisors

The number 16650 has 36 divisors, written as τ(16650) = 36 in number theory.

Sum of Divisors

σ(16650) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 25 + 30 + 37 + 45 + 50 + 74 + 75 + 90 + 111 + 150 + 185 + 222 + 225 + 333 + 370 + 450 + 555 + 666 + 925 + 1110 + 1665 + 1850 + 2775 + 3330 + 5550 + 8325 + 16650 = 45942

Properties of 16650

  • 16650 is composite.
  • 16650 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 45942.

Common Divisors with Another Number?

Looking for the divisors that 16650 shares with another number? Use our Greatest Common Factor (GCF) calculator — it finds all common divisors and the largest one.

Step-by-Step: How to Find the Divisors of 16650

An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √16650 ≈ 129.03. If i divides 16650, then both i and 16650/i are divisors.

  1. 1 divides 16650 (16650 ÷ 1 = 16650) → pair (1, 16650)
  2. 2 divides 16650 (16650 ÷ 2 = 8325) → pair (2, 8325)
  3. 3 divides 16650 (16650 ÷ 3 = 5550) → pair (3, 5550)
  4. 5 divides 16650 (16650 ÷ 5 = 3330) → pair (5, 3330)
  5. 6 divides 16650 (16650 ÷ 6 = 2775) → pair (6, 2775)
  6. 9 divides 16650 (16650 ÷ 9 = 1850) → pair (9, 1850)
  7. 10 divides 16650 (16650 ÷ 10 = 1665) → pair (10, 1665)
  8. 15 divides 16650 (16650 ÷ 15 = 1110) → pair (15, 1110)
  9. 18 divides 16650 (16650 ÷ 18 = 925) → pair (18, 925)
  10. 25 divides 16650 (16650 ÷ 25 = 666) → pair (25, 666)
  11. 30 divides 16650 (16650 ÷ 30 = 555) → pair (30, 555)
  12. 37 divides 16650 (16650 ÷ 37 = 450) → pair (37, 450)
  13. 45 divides 16650 (16650 ÷ 45 = 370) → pair (45, 370)
  14. 50 divides 16650 (16650 ÷ 50 = 333) → pair (50, 333)
  15. 74 divides 16650 (16650 ÷ 74 = 225) → pair (74, 225)
  16. 75 divides 16650 (16650 ÷ 75 = 222) → pair (75, 222)
  17. 90 divides 16650 (16650 ÷ 90 = 185) → pair (90, 185)
  18. 111 divides 16650 (16650 ÷ 111 = 150) → pair (111, 150)
  19. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 37, 45, 50, 74, 75, 90, 111, 150, 185, 222, 225, 333, 370, 450, 555, 666, 925, 1110, 1665, 1850, 2775, 3330, 5550, 8325, 16650} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 25 + 30 + 37 + 45 + 50 + 74 + 75 + 90 + 111 + 150 + 185 + 222 + 225 + 333 + 370 + 450 + 555 + 666 + 925 + 1110 + 1665 + 1850 + 2775 + 3330 + 5550 + 8325 + 16650 = 45942.

Nearby Examples

ndivisors countsum σ(n)
360241170
24020744
18018546
14415403
12016360
1009217
9012234
8412224

Related Operations for 16650

What Is a Divisor?

A divisor (also called a factor) of a positive integer n is any positive integer d such that n ÷ d has no remainder. In other words, d divides n evenly.

Every positive integer n has at least two divisors: 1 and n itself (with 1 being the trivial case of having only itself). Numbers with exactly 2 divisors are prime; numbers with 3 or more divisors are composite.

Why use this calculator? Beyond just listing divisors, this tool computes the sum σ(n), the count τ(n), prime factorization, divisor pairs (useful for visual learners and factoring problems), and detects whether n is a prime, a perfect square, or a perfect number.

Divisors Calculation Examples

Find all divisors of these numbers:

Related Calculators