Divisors of 4080: All 40 Factors

Quick Answer

4080 has 40 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 34, 40, 48, 51, 60, 68, 80, 85, 102, 120, 136, 170, 204, 240, 255, 272, 340, 408, 510, 680, 816, 1020, 1360, 2040, 4080.

Sum: 13392.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
40 divisors
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 34, 40, 48, 51, 60, 68, 80, 85, 102, 120, 136, 170, 204, 240, 255, 272, 340, 408, 510, 680, 816, 1020, 1360, 2040, 4080

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 4080

The number 4080 has 40 divisors:

1,  2,  3,  4,  5,  6,  8,  10,  12,  15,  16,  17,  20,  24,  30,  34,  40,  48,  51,  60,  68,  80,  85,  102,  120,  136,  170,  204,  240,  255,  272,  340,  408,  510,  680,  816,  1020,  1360,  2040,  4080

Divisor Pairs of 4080

Each pair multiplies to 4080:

Factor 1×Factor 2=Product
1×4080=4080
2×2040=4080
3×1360=4080
4×1020=4080
5×816=4080
6×680=4080
8×510=4080
10×408=4080
12×340=4080
15×272=4080
16×255=4080
17×240=4080
20×204=4080
24×170=4080
30×136=4080
34×120=4080
40×102=4080
48×85=4080
51×80=4080
60×68=4080

Number of Divisors

The number 4080 has 40 divisors, written as τ(4080) = 40 in number theory.

Sum of Divisors

σ(4080) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 17 + 20 + 24 + 30 + 34 + 40 + 48 + 51 + 60 + 68 + 80 + 85 + 102 + 120 + 136 + 170 + 204 + 240 + 255 + 272 + 340 + 408 + 510 + 680 + 816 + 1020 + 1360 + 2040 + 4080 = 13392

Properties of 4080

  • 4080 is composite.
  • 4080 is not a perfect square.
  • Number of divisors: 40.
  • Sum of divisors: 13392.

Common Divisors with Another Number?

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

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

  1. 1 divides 4080 (4080 ÷ 1 = 4080) → pair (1, 4080)
  2. 2 divides 4080 (4080 ÷ 2 = 2040) → pair (2, 2040)
  3. 3 divides 4080 (4080 ÷ 3 = 1360) → pair (3, 1360)
  4. 4 divides 4080 (4080 ÷ 4 = 1020) → pair (4, 1020)
  5. 5 divides 4080 (4080 ÷ 5 = 816) → pair (5, 816)
  6. 6 divides 4080 (4080 ÷ 6 = 680) → pair (6, 680)
  7. 8 divides 4080 (4080 ÷ 8 = 510) → pair (8, 510)
  8. 10 divides 4080 (4080 ÷ 10 = 408) → pair (10, 408)
  9. 12 divides 4080 (4080 ÷ 12 = 340) → pair (12, 340)
  10. 15 divides 4080 (4080 ÷ 15 = 272) → pair (15, 272)
  11. 16 divides 4080 (4080 ÷ 16 = 255) → pair (16, 255)
  12. 17 divides 4080 (4080 ÷ 17 = 240) → pair (17, 240)
  13. 20 divides 4080 (4080 ÷ 20 = 204) → pair (20, 204)
  14. 24 divides 4080 (4080 ÷ 24 = 170) → pair (24, 170)
  15. 30 divides 4080 (4080 ÷ 30 = 136) → pair (30, 136)
  16. 34 divides 4080 (4080 ÷ 34 = 120) → pair (34, 120)
  17. 40 divides 4080 (4080 ÷ 40 = 102) → pair (40, 102)
  18. 48 divides 4080 (4080 ÷ 48 = 85) → pair (48, 85)
  19. 51 divides 4080 (4080 ÷ 51 = 80) → pair (51, 80)
  20. 60 divides 4080 (4080 ÷ 60 = 68) → pair (60, 68)
  21. Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 34, 40, 48, 51, 60, 68, 80, 85, 102, 120, 136, 170, 204, 240, 255, 272, 340, 408, 510, 680, 816, 1020, 1360, 2040, 4080} — total 40 divisors.
  22. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 17 + 20 + 24 + 30 + 34 + 40 + 48 + 51 + 60 + 68 + 80 + 85 + 102 + 120 + 136 + 170 + 204 + 240 + 255 + 272 + 340 + 408 + 510 + 680 + 816 + 1020 + 1360 + 2040 + 4080 = 13392.

Nearby Examples

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

Related Operations for 4080

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