Divisors of 9100: All 36 Factors

Quick Answer

9100 has 36 divisors (factors): 1, 2, 4, 5, 7, 10, 13, 14, 20, 25, 26, 28, 35, 50, 52, 65, 70, 91, 100, 130, 140, 175, 182, 260, 325, 350, 364, 455, 650, 700, 910, 1300, 1820, 2275, 4550, 9100.

Sum: 24304.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 7, 10, 13, 14, 20, 25, 26, 28, 35, 50, 52, 65, 70, 91, 100, 130, 140, 175, 182, 260, 325, 350, 364, 455, 650, 700, 910, 1300, 1820, 2275, 4550, 9100

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 9100

The number 9100 has 36 divisors:

1,  2,  4,  5,  7,  10,  13,  14,  20,  25,  26,  28,  35,  50,  52,  65,  70,  91,  100,  130,  140,  175,  182,  260,  325,  350,  364,  455,  650,  700,  910,  1300,  1820,  2275,  4550,  9100

Divisor Pairs of 9100

Each pair multiplies to 9100:

Factor 1×Factor 2=Product
1×9100=9100
2×4550=9100
4×2275=9100
5×1820=9100
7×1300=9100
10×910=9100
13×700=9100
14×650=9100
20×455=9100
25×364=9100
26×350=9100
28×325=9100
35×260=9100
50×182=9100
52×175=9100
65×140=9100
70×130=9100
91×100=9100

Number of Divisors

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

Sum of Divisors

σ(9100) = 1 + 2 + 4 + 5 + 7 + 10 + 13 + 14 + 20 + 25 + 26 + 28 + 35 + 50 + 52 + 65 + 70 + 91 + 100 + 130 + 140 + 175 + 182 + 260 + 325 + 350 + 364 + 455 + 650 + 700 + 910 + 1300 + 1820 + 2275 + 4550 + 9100 = 24304

Properties of 9100

  • 9100 is composite.
  • 9100 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 24304.

Common Divisors with Another Number?

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

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

  1. 1 divides 9100 (9100 ÷ 1 = 9100) → pair (1, 9100)
  2. 2 divides 9100 (9100 ÷ 2 = 4550) → pair (2, 4550)
  3. 4 divides 9100 (9100 ÷ 4 = 2275) → pair (4, 2275)
  4. 5 divides 9100 (9100 ÷ 5 = 1820) → pair (5, 1820)
  5. 7 divides 9100 (9100 ÷ 7 = 1300) → pair (7, 1300)
  6. 10 divides 9100 (9100 ÷ 10 = 910) → pair (10, 910)
  7. 13 divides 9100 (9100 ÷ 13 = 700) → pair (13, 700)
  8. 14 divides 9100 (9100 ÷ 14 = 650) → pair (14, 650)
  9. 20 divides 9100 (9100 ÷ 20 = 455) → pair (20, 455)
  10. 25 divides 9100 (9100 ÷ 25 = 364) → pair (25, 364)
  11. 26 divides 9100 (9100 ÷ 26 = 350) → pair (26, 350)
  12. 28 divides 9100 (9100 ÷ 28 = 325) → pair (28, 325)
  13. 35 divides 9100 (9100 ÷ 35 = 260) → pair (35, 260)
  14. 50 divides 9100 (9100 ÷ 50 = 182) → pair (50, 182)
  15. 52 divides 9100 (9100 ÷ 52 = 175) → pair (52, 175)
  16. 65 divides 9100 (9100 ÷ 65 = 140) → pair (65, 140)
  17. 70 divides 9100 (9100 ÷ 70 = 130) → pair (70, 130)
  18. 91 divides 9100 (9100 ÷ 91 = 100) → pair (91, 100)
  19. Collect all unique values: {1, 2, 4, 5, 7, 10, 13, 14, 20, 25, 26, 28, 35, 50, 52, 65, 70, 91, 100, 130, 140, 175, 182, 260, 325, 350, 364, 455, 650, 700, 910, 1300, 1820, 2275, 4550, 9100} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 7 + 10 + 13 + 14 + 20 + 25 + 26 + 28 + 35 + 50 + 52 + 65 + 70 + 91 + 100 + 130 + 140 + 175 + 182 + 260 + 325 + 350 + 364 + 455 + 650 + 700 + 910 + 1300 + 1820 + 2275 + 4550 + 9100 = 24304.

Nearby Examples

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

Related Operations for 9100

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