Divisors of 14208: All 32 Factors

Quick Answer

14208 has 32 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 37, 48, 64, 74, 96, 111, 128, 148, 192, 222, 296, 384, 444, 592, 888, 1184, 1776, 2368, 3552, 4736, 7104, 14208.

Sum: 38760.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 37, 48, 64, 74, 96, 111, 128, 148, 192, 222, 296, 384, 444, 592, 888, 1184, 1776, 2368, 3552, 4736, 7104, 14208

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 14208

The number 14208 has 32 divisors:

1,  2,  3,  4,  6,  8,  12,  16,  24,  32,  37,  48,  64,  74,  96,  111,  128,  148,  192,  222,  296,  384,  444,  592,  888,  1184,  1776,  2368,  3552,  4736,  7104,  14208

Divisor Pairs of 14208

Each pair multiplies to 14208:

Factor 1×Factor 2=Product
1×14208=14208
2×7104=14208
3×4736=14208
4×3552=14208
6×2368=14208
8×1776=14208
12×1184=14208
16×888=14208
24×592=14208
32×444=14208
37×384=14208
48×296=14208
64×222=14208
74×192=14208
96×148=14208
111×128=14208

Number of Divisors

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

Sum of Divisors

σ(14208) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 37 + 48 + 64 + 74 + 96 + 111 + 128 + 148 + 192 + 222 + 296 + 384 + 444 + 592 + 888 + 1184 + 1776 + 2368 + 3552 + 4736 + 7104 + 14208 = 38760

Properties of 14208

  • 14208 is composite.
  • 14208 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 38760.

Common Divisors with Another Number?

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

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

  1. 1 divides 14208 (14208 ÷ 1 = 14208) → pair (1, 14208)
  2. 2 divides 14208 (14208 ÷ 2 = 7104) → pair (2, 7104)
  3. 3 divides 14208 (14208 ÷ 3 = 4736) → pair (3, 4736)
  4. 4 divides 14208 (14208 ÷ 4 = 3552) → pair (4, 3552)
  5. 6 divides 14208 (14208 ÷ 6 = 2368) → pair (6, 2368)
  6. 8 divides 14208 (14208 ÷ 8 = 1776) → pair (8, 1776)
  7. 12 divides 14208 (14208 ÷ 12 = 1184) → pair (12, 1184)
  8. 16 divides 14208 (14208 ÷ 16 = 888) → pair (16, 888)
  9. 24 divides 14208 (14208 ÷ 24 = 592) → pair (24, 592)
  10. 32 divides 14208 (14208 ÷ 32 = 444) → pair (32, 444)
  11. 37 divides 14208 (14208 ÷ 37 = 384) → pair (37, 384)
  12. 48 divides 14208 (14208 ÷ 48 = 296) → pair (48, 296)
  13. 64 divides 14208 (14208 ÷ 64 = 222) → pair (64, 222)
  14. 74 divides 14208 (14208 ÷ 74 = 192) → pair (74, 192)
  15. 96 divides 14208 (14208 ÷ 96 = 148) → pair (96, 148)
  16. 111 divides 14208 (14208 ÷ 111 = 128) → pair (111, 128)
  17. Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 37, 48, 64, 74, 96, 111, 128, 148, 192, 222, 296, 384, 444, 592, 888, 1184, 1776, 2368, 3552, 4736, 7104, 14208} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 37 + 48 + 64 + 74 + 96 + 111 + 128 + 148 + 192 + 222 + 296 + 384 + 444 + 592 + 888 + 1184 + 1776 + 2368 + 3552 + 4736 + 7104 + 14208 = 38760.

Nearby Examples

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

Related Operations for 14208

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