Divisors of 11640: All 32 Factors

Quick Answer

11640 has 32 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 97, 120, 194, 291, 388, 485, 582, 776, 970, 1164, 1455, 1940, 2328, 2910, 3880, 5820, 11640.

Sum: 35280.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 97, 120, 194, 291, 388, 485, 582, 776, 970, 1164, 1455, 1940, 2328, 2910, 3880, 5820, 11640

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 11640

The number 11640 has 32 divisors:

1,  2,  3,  4,  5,  6,  8,  10,  12,  15,  20,  24,  30,  40,  60,  97,  120,  194,  291,  388,  485,  582,  776,  970,  1164,  1455,  1940,  2328,  2910,  3880,  5820,  11640

Divisor Pairs of 11640

Each pair multiplies to 11640:

Factor 1×Factor 2=Product
1×11640=11640
2×5820=11640
3×3880=11640
4×2910=11640
5×2328=11640
6×1940=11640
8×1455=11640
10×1164=11640
12×970=11640
15×776=11640
20×582=11640
24×485=11640
30×388=11640
40×291=11640
60×194=11640
97×120=11640

Number of Divisors

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

Sum of Divisors

σ(11640) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 20 + 24 + 30 + 40 + 60 + 97 + 120 + 194 + 291 + 388 + 485 + 582 + 776 + 970 + 1164 + 1455 + 1940 + 2328 + 2910 + 3880 + 5820 + 11640 = 35280

Properties of 11640

  • 11640 is composite.
  • 11640 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 35280.

Common Divisors with Another Number?

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

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

  1. 1 divides 11640 (11640 ÷ 1 = 11640) → pair (1, 11640)
  2. 2 divides 11640 (11640 ÷ 2 = 5820) → pair (2, 5820)
  3. 3 divides 11640 (11640 ÷ 3 = 3880) → pair (3, 3880)
  4. 4 divides 11640 (11640 ÷ 4 = 2910) → pair (4, 2910)
  5. 5 divides 11640 (11640 ÷ 5 = 2328) → pair (5, 2328)
  6. 6 divides 11640 (11640 ÷ 6 = 1940) → pair (6, 1940)
  7. 8 divides 11640 (11640 ÷ 8 = 1455) → pair (8, 1455)
  8. 10 divides 11640 (11640 ÷ 10 = 1164) → pair (10, 1164)
  9. 12 divides 11640 (11640 ÷ 12 = 970) → pair (12, 970)
  10. 15 divides 11640 (11640 ÷ 15 = 776) → pair (15, 776)
  11. 20 divides 11640 (11640 ÷ 20 = 582) → pair (20, 582)
  12. 24 divides 11640 (11640 ÷ 24 = 485) → pair (24, 485)
  13. 30 divides 11640 (11640 ÷ 30 = 388) → pair (30, 388)
  14. 40 divides 11640 (11640 ÷ 40 = 291) → pair (40, 291)
  15. 60 divides 11640 (11640 ÷ 60 = 194) → pair (60, 194)
  16. 97 divides 11640 (11640 ÷ 97 = 120) → pair (97, 120)
  17. Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 97, 120, 194, 291, 388, 485, 582, 776, 970, 1164, 1455, 1940, 2328, 2910, 3880, 5820, 11640} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 20 + 24 + 30 + 40 + 60 + 97 + 120 + 194 + 291 + 388 + 485 + 582 + 776 + 970 + 1164 + 1455 + 1940 + 2328 + 2910 + 3880 + 5820 + 11640 = 35280.

Nearby Examples

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

Related Operations for 11640

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