Divisors of 16296: All 32 Factors

Quick Answer

16296 has 32 divisors (factors): 1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 97, 168, 194, 291, 388, 582, 679, 776, 1164, 1358, 2037, 2328, 2716, 4074, 5432, 8148, 16296.

Sum: 47040.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 97, 168, 194, 291, 388, 582, 679, 776, 1164, 1358, 2037, 2328, 2716, 4074, 5432, 8148, 16296

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 16296

The number 16296 has 32 divisors:

1,  2,  3,  4,  6,  7,  8,  12,  14,  21,  24,  28,  42,  56,  84,  97,  168,  194,  291,  388,  582,  679,  776,  1164,  1358,  2037,  2328,  2716,  4074,  5432,  8148,  16296

Divisor Pairs of 16296

Each pair multiplies to 16296:

Factor 1×Factor 2=Product
1×16296=16296
2×8148=16296
3×5432=16296
4×4074=16296
6×2716=16296
7×2328=16296
8×2037=16296
12×1358=16296
14×1164=16296
21×776=16296
24×679=16296
28×582=16296
42×388=16296
56×291=16296
84×194=16296
97×168=16296

Number of Divisors

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

Sum of Divisors

σ(16296) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 84 + 97 + 168 + 194 + 291 + 388 + 582 + 679 + 776 + 1164 + 1358 + 2037 + 2328 + 2716 + 4074 + 5432 + 8148 + 16296 = 47040

Properties of 16296

  • 16296 is composite.
  • 16296 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 47040.

Common Divisors with Another Number?

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

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

  1. 1 divides 16296 (16296 ÷ 1 = 16296) → pair (1, 16296)
  2. 2 divides 16296 (16296 ÷ 2 = 8148) → pair (2, 8148)
  3. 3 divides 16296 (16296 ÷ 3 = 5432) → pair (3, 5432)
  4. 4 divides 16296 (16296 ÷ 4 = 4074) → pair (4, 4074)
  5. 6 divides 16296 (16296 ÷ 6 = 2716) → pair (6, 2716)
  6. 7 divides 16296 (16296 ÷ 7 = 2328) → pair (7, 2328)
  7. 8 divides 16296 (16296 ÷ 8 = 2037) → pair (8, 2037)
  8. 12 divides 16296 (16296 ÷ 12 = 1358) → pair (12, 1358)
  9. 14 divides 16296 (16296 ÷ 14 = 1164) → pair (14, 1164)
  10. 21 divides 16296 (16296 ÷ 21 = 776) → pair (21, 776)
  11. 24 divides 16296 (16296 ÷ 24 = 679) → pair (24, 679)
  12. 28 divides 16296 (16296 ÷ 28 = 582) → pair (28, 582)
  13. 42 divides 16296 (16296 ÷ 42 = 388) → pair (42, 388)
  14. 56 divides 16296 (16296 ÷ 56 = 291) → pair (56, 291)
  15. 84 divides 16296 (16296 ÷ 84 = 194) → pair (84, 194)
  16. 97 divides 16296 (16296 ÷ 97 = 168) → pair (97, 168)
  17. Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 97, 168, 194, 291, 388, 582, 679, 776, 1164, 1358, 2037, 2328, 2716, 4074, 5432, 8148, 16296} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 84 + 97 + 168 + 194 + 291 + 388 + 582 + 679 + 776 + 1164 + 1358 + 2037 + 2328 + 2716 + 4074 + 5432 + 8148 + 16296 = 47040.

Nearby Examples

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

Related Operations for 16296

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