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
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
Prime Factorization of 11130
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 divides 11130 (11130 ÷ 1 = 11130) → pair (1, 11130)
- 2 divides 11130 (11130 ÷ 2 = 5565) → pair (2, 5565)
- 3 divides 11130 (11130 ÷ 3 = 3710) → pair (3, 3710)
- 5 divides 11130 (11130 ÷ 5 = 2226) → pair (5, 2226)
- 6 divides 11130 (11130 ÷ 6 = 1855) → pair (6, 1855)
- 7 divides 11130 (11130 ÷ 7 = 1590) → pair (7, 1590)
- 10 divides 11130 (11130 ÷ 10 = 1113) → pair (10, 1113)
- 14 divides 11130 (11130 ÷ 14 = 795) → pair (14, 795)
- 15 divides 11130 (11130 ÷ 15 = 742) → pair (15, 742)
- 21 divides 11130 (11130 ÷ 21 = 530) → pair (21, 530)
- 30 divides 11130 (11130 ÷ 30 = 371) → pair (30, 371)
- 35 divides 11130 (11130 ÷ 35 = 318) → pair (35, 318)
- 42 divides 11130 (11130 ÷ 42 = 265) → pair (42, 265)
- 53 divides 11130 (11130 ÷ 53 = 210) → pair (53, 210)
- 70 divides 11130 (11130 ÷ 70 = 159) → pair (70, 159)
- 105 divides 11130 (11130 ÷ 105 = 106) → pair (105, 106)
- 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.
- 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
Related Operations for 11130
- Multiples of a Number — "outward" complement of divisors
- 11130 Prime Factorization — decompose into prime building blocks
- Find GCF of 11130 and another number
- Find LCM of 11130 and another number
- Is 11130 a perfect square? (odd divisor count ⇔ yes)
See also our tables of divisors:
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
- Multiples of a Number — "outward" complement
- Prime Factorization — product of prime divisors
- Greatest Common Factor (GCF) — largest common divisor of 2+ numbers
- Least Common Multiple (LCM) — smallest common multiple
- Is N a Perfect Square? — odd divisor count check