Divisors of 11130: All 32 Factors

Quick Answer

11130 has 32 divisors (factors): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 53, 70, 105, 106, 159, 210, 265, 318, 371, 530, 742, 795, 1113, 1590, 1855, 2226, 3710, 5565, 11130.

Sum: 31104.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 53, 70, 105, 106, 159, 210, 265, 318, 371, 530, 742, 795, 1113, 1590, 1855, 2226, 3710, 5565, 11130

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 11130

The number 11130 has 32 divisors:

1,  2,  3,  5,  6,  7,  10,  14,  15,  21,  30,  35,  42,  53,  70,  105,  106,  159,  210,  265,  318,  371,  530,  742,  795,  1113,  1590,  1855,  2226,  3710,  5565,  11130

Divisor Pairs of 11130

Each pair multiplies to 11130:

Factor 1×Factor 2=Product
1×11130=11130
2×5565=11130
3×3710=11130
5×2226=11130
6×1855=11130
7×1590=11130
10×1113=11130
14×795=11130
15×742=11130
21×530=11130
30×371=11130
35×318=11130
42×265=11130
53×210=11130
70×159=11130
105×106=11130

Number of Divisors

The number 11130 has 32 divisors, written as τ(11130) = 32 in number theory.

Sum of Divisors

σ(11130) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 53 + 70 + 105 + 106 + 159 + 210 + 265 + 318 + 371 + 530 + 742 + 795 + 1113 + 1590 + 1855 + 2226 + 3710 + 5565 + 11130 = 31104

Properties of 11130

  • 11130 is composite.
  • 11130 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 31104.

Common Divisors with Another Number?

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

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

  1. 1 divides 11130 (11130 ÷ 1 = 11130) → pair (1, 11130)
  2. 2 divides 11130 (11130 ÷ 2 = 5565) → pair (2, 5565)
  3. 3 divides 11130 (11130 ÷ 3 = 3710) → pair (3, 3710)
  4. 5 divides 11130 (11130 ÷ 5 = 2226) → pair (5, 2226)
  5. 6 divides 11130 (11130 ÷ 6 = 1855) → pair (6, 1855)
  6. 7 divides 11130 (11130 ÷ 7 = 1590) → pair (7, 1590)
  7. 10 divides 11130 (11130 ÷ 10 = 1113) → pair (10, 1113)
  8. 14 divides 11130 (11130 ÷ 14 = 795) → pair (14, 795)
  9. 15 divides 11130 (11130 ÷ 15 = 742) → pair (15, 742)
  10. 21 divides 11130 (11130 ÷ 21 = 530) → pair (21, 530)
  11. 30 divides 11130 (11130 ÷ 30 = 371) → pair (30, 371)
  12. 35 divides 11130 (11130 ÷ 35 = 318) → pair (35, 318)
  13. 42 divides 11130 (11130 ÷ 42 = 265) → pair (42, 265)
  14. 53 divides 11130 (11130 ÷ 53 = 210) → pair (53, 210)
  15. 70 divides 11130 (11130 ÷ 70 = 159) → pair (70, 159)
  16. 105 divides 11130 (11130 ÷ 105 = 106) → pair (105, 106)
  17. Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 53, 70, 105, 106, 159, 210, 265, 318, 371, 530, 742, 795, 1113, 1590, 1855, 2226, 3710, 5565, 11130} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 53 + 70 + 105 + 106 + 159 + 210 + 265 + 318 + 371 + 530 + 742 + 795 + 1113 + 1590 + 1855 + 2226 + 3710 + 5565 + 11130 = 31104.

Nearby Examples

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

Related Operations for 11130

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