Divisors of 16100: All 36 Factors

Quick Answer

16100 has 36 divisors (factors): 1, 2, 4, 5, 7, 10, 14, 20, 23, 25, 28, 35, 46, 50, 70, 92, 100, 115, 140, 161, 175, 230, 322, 350, 460, 575, 644, 700, 805, 1150, 1610, 2300, 3220, 4025, 8050, 16100.

Sum: 41664.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 7, 10, 14, 20, 23, 25, 28, 35, 46, 50, 70, 92, 100, 115, 140, 161, 175, 230, 322, 350, 460, 575, 644, 700, 805, 1150, 1610, 2300, 3220, 4025, 8050, 16100

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 16100

The number 16100 has 36 divisors:

1,  2,  4,  5,  7,  10,  14,  20,  23,  25,  28,  35,  46,  50,  70,  92,  100,  115,  140,  161,  175,  230,  322,  350,  460,  575,  644,  700,  805,  1150,  1610,  2300,  3220,  4025,  8050,  16100

Divisor Pairs of 16100

Each pair multiplies to 16100:

Factor 1×Factor 2=Product
1×16100=16100
2×8050=16100
4×4025=16100
5×3220=16100
7×2300=16100
10×1610=16100
14×1150=16100
20×805=16100
23×700=16100
25×644=16100
28×575=16100
35×460=16100
46×350=16100
50×322=16100
70×230=16100
92×175=16100
100×161=16100
115×140=16100

Number of Divisors

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

Sum of Divisors

σ(16100) = 1 + 2 + 4 + 5 + 7 + 10 + 14 + 20 + 23 + 25 + 28 + 35 + 46 + 50 + 70 + 92 + 100 + 115 + 140 + 161 + 175 + 230 + 322 + 350 + 460 + 575 + 644 + 700 + 805 + 1150 + 1610 + 2300 + 3220 + 4025 + 8050 + 16100 = 41664

Properties of 16100

  • 16100 is composite.
  • 16100 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 41664.

Common Divisors with Another Number?

Looking for the divisors that 16100 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 16100

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

  1. 1 divides 16100 (16100 ÷ 1 = 16100) → pair (1, 16100)
  2. 2 divides 16100 (16100 ÷ 2 = 8050) → pair (2, 8050)
  3. 4 divides 16100 (16100 ÷ 4 = 4025) → pair (4, 4025)
  4. 5 divides 16100 (16100 ÷ 5 = 3220) → pair (5, 3220)
  5. 7 divides 16100 (16100 ÷ 7 = 2300) → pair (7, 2300)
  6. 10 divides 16100 (16100 ÷ 10 = 1610) → pair (10, 1610)
  7. 14 divides 16100 (16100 ÷ 14 = 1150) → pair (14, 1150)
  8. 20 divides 16100 (16100 ÷ 20 = 805) → pair (20, 805)
  9. 23 divides 16100 (16100 ÷ 23 = 700) → pair (23, 700)
  10. 25 divides 16100 (16100 ÷ 25 = 644) → pair (25, 644)
  11. 28 divides 16100 (16100 ÷ 28 = 575) → pair (28, 575)
  12. 35 divides 16100 (16100 ÷ 35 = 460) → pair (35, 460)
  13. 46 divides 16100 (16100 ÷ 46 = 350) → pair (46, 350)
  14. 50 divides 16100 (16100 ÷ 50 = 322) → pair (50, 322)
  15. 70 divides 16100 (16100 ÷ 70 = 230) → pair (70, 230)
  16. 92 divides 16100 (16100 ÷ 92 = 175) → pair (92, 175)
  17. 100 divides 16100 (16100 ÷ 100 = 161) → pair (100, 161)
  18. 115 divides 16100 (16100 ÷ 115 = 140) → pair (115, 140)
  19. Collect all unique values: {1, 2, 4, 5, 7, 10, 14, 20, 23, 25, 28, 35, 46, 50, 70, 92, 100, 115, 140, 161, 175, 230, 322, 350, 460, 575, 644, 700, 805, 1150, 1610, 2300, 3220, 4025, 8050, 16100} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 7 + 10 + 14 + 20 + 23 + 25 + 28 + 35 + 46 + 50 + 70 + 92 + 100 + 115 + 140 + 161 + 175 + 230 + 322 + 350 + 460 + 575 + 644 + 700 + 805 + 1150 + 1610 + 2300 + 3220 + 4025 + 8050 + 16100 = 41664.

Nearby Examples

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

Related Operations for 16100

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