Divisors of 11480: All 32 Factors

Quick Answer

11480 has 32 divisors (factors): 1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 41, 56, 70, 82, 140, 164, 205, 280, 287, 328, 410, 574, 820, 1148, 1435, 1640, 2296, 2870, 5740, 11480.

Sum: 30240.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 41, 56, 70, 82, 140, 164, 205, 280, 287, 328, 410, 574, 820, 1148, 1435, 1640, 2296, 2870, 5740, 11480

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 11480

The number 11480 has 32 divisors:

1,  2,  4,  5,  7,  8,  10,  14,  20,  28,  35,  40,  41,  56,  70,  82,  140,  164,  205,  280,  287,  328,  410,  574,  820,  1148,  1435,  1640,  2296,  2870,  5740,  11480

Divisor Pairs of 11480

Each pair multiplies to 11480:

Factor 1×Factor 2=Product
1×11480=11480
2×5740=11480
4×2870=11480
5×2296=11480
7×1640=11480
8×1435=11480
10×1148=11480
14×820=11480
20×574=11480
28×410=11480
35×328=11480
40×287=11480
41×280=11480
56×205=11480
70×164=11480
82×140=11480

Number of Divisors

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

Sum of Divisors

σ(11480) = 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 20 + 28 + 35 + 40 + 41 + 56 + 70 + 82 + 140 + 164 + 205 + 280 + 287 + 328 + 410 + 574 + 820 + 1148 + 1435 + 1640 + 2296 + 2870 + 5740 + 11480 = 30240

Properties of 11480

  • 11480 is composite.
  • 11480 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 30240.

Common Divisors with Another Number?

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

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

  1. 1 divides 11480 (11480 ÷ 1 = 11480) → pair (1, 11480)
  2. 2 divides 11480 (11480 ÷ 2 = 5740) → pair (2, 5740)
  3. 4 divides 11480 (11480 ÷ 4 = 2870) → pair (4, 2870)
  4. 5 divides 11480 (11480 ÷ 5 = 2296) → pair (5, 2296)
  5. 7 divides 11480 (11480 ÷ 7 = 1640) → pair (7, 1640)
  6. 8 divides 11480 (11480 ÷ 8 = 1435) → pair (8, 1435)
  7. 10 divides 11480 (11480 ÷ 10 = 1148) → pair (10, 1148)
  8. 14 divides 11480 (11480 ÷ 14 = 820) → pair (14, 820)
  9. 20 divides 11480 (11480 ÷ 20 = 574) → pair (20, 574)
  10. 28 divides 11480 (11480 ÷ 28 = 410) → pair (28, 410)
  11. 35 divides 11480 (11480 ÷ 35 = 328) → pair (35, 328)
  12. 40 divides 11480 (11480 ÷ 40 = 287) → pair (40, 287)
  13. 41 divides 11480 (11480 ÷ 41 = 280) → pair (41, 280)
  14. 56 divides 11480 (11480 ÷ 56 = 205) → pair (56, 205)
  15. 70 divides 11480 (11480 ÷ 70 = 164) → pair (70, 164)
  16. 82 divides 11480 (11480 ÷ 82 = 140) → pair (82, 140)
  17. Collect all unique values: {1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 41, 56, 70, 82, 140, 164, 205, 280, 287, 328, 410, 574, 820, 1148, 1435, 1640, 2296, 2870, 5740, 11480} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 20 + 28 + 35 + 40 + 41 + 56 + 70 + 82 + 140 + 164 + 205 + 280 + 287 + 328 + 410 + 574 + 820 + 1148 + 1435 + 1640 + 2296 + 2870 + 5740 + 11480 = 30240.

Nearby Examples

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

Related Operations for 11480

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