Divisors of 14196: All 36 Factors

Quick Answer

14196 has 36 divisors (factors): 1, 2, 3, 4, 6, 7, 12, 13, 14, 21, 26, 28, 39, 42, 52, 78, 84, 91, 156, 169, 182, 273, 338, 364, 507, 546, 676, 1014, 1092, 1183, 2028, 2366, 3549, 4732, 7098, 14196.

Sum: 40992.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 7, 12, 13, 14, 21, 26, 28, 39, 42, 52, 78, 84, 91, 156, 169, 182, 273, 338, 364, 507, 546, 676, 1014, 1092, 1183, 2028, 2366, 3549, 4732, 7098, 14196

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 14196

The number 14196 has 36 divisors:

1,  2,  3,  4,  6,  7,  12,  13,  14,  21,  26,  28,  39,  42,  52,  78,  84,  91,  156,  169,  182,  273,  338,  364,  507,  546,  676,  1014,  1092,  1183,  2028,  2366,  3549,  4732,  7098,  14196

Divisor Pairs of 14196

Each pair multiplies to 14196:

Factor 1×Factor 2=Product
1×14196=14196
2×7098=14196
3×4732=14196
4×3549=14196
6×2366=14196
7×2028=14196
12×1183=14196
13×1092=14196
14×1014=14196
21×676=14196
26×546=14196
28×507=14196
39×364=14196
42×338=14196
52×273=14196
78×182=14196
84×169=14196
91×156=14196

Number of Divisors

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

Sum of Divisors

σ(14196) = 1 + 2 + 3 + 4 + 6 + 7 + 12 + 13 + 14 + 21 + 26 + 28 + 39 + 42 + 52 + 78 + 84 + 91 + 156 + 169 + 182 + 273 + 338 + 364 + 507 + 546 + 676 + 1014 + 1092 + 1183 + 2028 + 2366 + 3549 + 4732 + 7098 + 14196 = 40992

Properties of 14196

  • 14196 is composite.
  • 14196 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 40992.

Common Divisors with Another Number?

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

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

  1. 1 divides 14196 (14196 ÷ 1 = 14196) → pair (1, 14196)
  2. 2 divides 14196 (14196 ÷ 2 = 7098) → pair (2, 7098)
  3. 3 divides 14196 (14196 ÷ 3 = 4732) → pair (3, 4732)
  4. 4 divides 14196 (14196 ÷ 4 = 3549) → pair (4, 3549)
  5. 6 divides 14196 (14196 ÷ 6 = 2366) → pair (6, 2366)
  6. 7 divides 14196 (14196 ÷ 7 = 2028) → pair (7, 2028)
  7. 12 divides 14196 (14196 ÷ 12 = 1183) → pair (12, 1183)
  8. 13 divides 14196 (14196 ÷ 13 = 1092) → pair (13, 1092)
  9. 14 divides 14196 (14196 ÷ 14 = 1014) → pair (14, 1014)
  10. 21 divides 14196 (14196 ÷ 21 = 676) → pair (21, 676)
  11. 26 divides 14196 (14196 ÷ 26 = 546) → pair (26, 546)
  12. 28 divides 14196 (14196 ÷ 28 = 507) → pair (28, 507)
  13. 39 divides 14196 (14196 ÷ 39 = 364) → pair (39, 364)
  14. 42 divides 14196 (14196 ÷ 42 = 338) → pair (42, 338)
  15. 52 divides 14196 (14196 ÷ 52 = 273) → pair (52, 273)
  16. 78 divides 14196 (14196 ÷ 78 = 182) → pair (78, 182)
  17. 84 divides 14196 (14196 ÷ 84 = 169) → pair (84, 169)
  18. 91 divides 14196 (14196 ÷ 91 = 156) → pair (91, 156)
  19. Collect all unique values: {1, 2, 3, 4, 6, 7, 12, 13, 14, 21, 26, 28, 39, 42, 52, 78, 84, 91, 156, 169, 182, 273, 338, 364, 507, 546, 676, 1014, 1092, 1183, 2028, 2366, 3549, 4732, 7098, 14196} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 12 + 13 + 14 + 21 + 26 + 28 + 39 + 42 + 52 + 78 + 84 + 91 + 156 + 169 + 182 + 273 + 338 + 364 + 507 + 546 + 676 + 1014 + 1092 + 1183 + 2028 + 2366 + 3549 + 4732 + 7098 + 14196 = 40992.

Nearby Examples

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

Related Operations for 14196

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