Divisors of 14080: All 36 Factors

Quick Answer

14080 has 36 divisors (factors): 1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 32, 40, 44, 55, 64, 80, 88, 110, 128, 160, 176, 220, 256, 320, 352, 440, 640, 704, 880, 1280, 1408, 1760, 2816, 3520, 7040, 14080.

Sum: 36792.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 32, 40, 44, 55, 64, 80, 88, 110, 128, 160, 176, 220, 256, 320, 352, 440, 640, 704, 880, 1280, 1408, 1760, 2816, 3520, 7040, 14080

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 14080

The number 14080 has 36 divisors:

1,  2,  4,  5,  8,  10,  11,  16,  20,  22,  32,  40,  44,  55,  64,  80,  88,  110,  128,  160,  176,  220,  256,  320,  352,  440,  640,  704,  880,  1280,  1408,  1760,  2816,  3520,  7040,  14080

Divisor Pairs of 14080

Each pair multiplies to 14080:

Factor 1×Factor 2=Product
1×14080=14080
2×7040=14080
4×3520=14080
5×2816=14080
8×1760=14080
10×1408=14080
11×1280=14080
16×880=14080
20×704=14080
22×640=14080
32×440=14080
40×352=14080
44×320=14080
55×256=14080
64×220=14080
80×176=14080
88×160=14080
110×128=14080

Number of Divisors

The number 14080 has 36 divisors, written as τ(14080) = 36 in number theory.

Sum of Divisors

σ(14080) = 1 + 2 + 4 + 5 + 8 + 10 + 11 + 16 + 20 + 22 + 32 + 40 + 44 + 55 + 64 + 80 + 88 + 110 + 128 + 160 + 176 + 220 + 256 + 320 + 352 + 440 + 640 + 704 + 880 + 1280 + 1408 + 1760 + 2816 + 3520 + 7040 + 14080 = 36792

Properties of 14080

  • 14080 is composite.
  • 14080 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 36792.

Common Divisors with Another Number?

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

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

  1. 1 divides 14080 (14080 ÷ 1 = 14080) → pair (1, 14080)
  2. 2 divides 14080 (14080 ÷ 2 = 7040) → pair (2, 7040)
  3. 4 divides 14080 (14080 ÷ 4 = 3520) → pair (4, 3520)
  4. 5 divides 14080 (14080 ÷ 5 = 2816) → pair (5, 2816)
  5. 8 divides 14080 (14080 ÷ 8 = 1760) → pair (8, 1760)
  6. 10 divides 14080 (14080 ÷ 10 = 1408) → pair (10, 1408)
  7. 11 divides 14080 (14080 ÷ 11 = 1280) → pair (11, 1280)
  8. 16 divides 14080 (14080 ÷ 16 = 880) → pair (16, 880)
  9. 20 divides 14080 (14080 ÷ 20 = 704) → pair (20, 704)
  10. 22 divides 14080 (14080 ÷ 22 = 640) → pair (22, 640)
  11. 32 divides 14080 (14080 ÷ 32 = 440) → pair (32, 440)
  12. 40 divides 14080 (14080 ÷ 40 = 352) → pair (40, 352)
  13. 44 divides 14080 (14080 ÷ 44 = 320) → pair (44, 320)
  14. 55 divides 14080 (14080 ÷ 55 = 256) → pair (55, 256)
  15. 64 divides 14080 (14080 ÷ 64 = 220) → pair (64, 220)
  16. 80 divides 14080 (14080 ÷ 80 = 176) → pair (80, 176)
  17. 88 divides 14080 (14080 ÷ 88 = 160) → pair (88, 160)
  18. 110 divides 14080 (14080 ÷ 110 = 128) → pair (110, 128)
  19. Collect all unique values: {1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 32, 40, 44, 55, 64, 80, 88, 110, 128, 160, 176, 220, 256, 320, 352, 440, 640, 704, 880, 1280, 1408, 1760, 2816, 3520, 7040, 14080} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 11 + 16 + 20 + 22 + 32 + 40 + 44 + 55 + 64 + 80 + 88 + 110 + 128 + 160 + 176 + 220 + 256 + 320 + 352 + 440 + 640 + 704 + 880 + 1280 + 1408 + 1760 + 2816 + 3520 + 7040 + 14080 = 36792.

Nearby Examples

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

Related Operations for 14080

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