Divisors of 12264: All 32 Factors

Quick Answer

12264 has 32 divisors (factors): 1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 73, 84, 146, 168, 219, 292, 438, 511, 584, 876, 1022, 1533, 1752, 2044, 3066, 4088, 6132, 12264.

Sum: 35520.

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, 73, 84, 146, 168, 219, 292, 438, 511, 584, 876, 1022, 1533, 1752, 2044, 3066, 4088, 6132, 12264

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 12264

The number 12264 has 32 divisors:

1,  2,  3,  4,  6,  7,  8,  12,  14,  21,  24,  28,  42,  56,  73,  84,  146,  168,  219,  292,  438,  511,  584,  876,  1022,  1533,  1752,  2044,  3066,  4088,  6132,  12264

Divisor Pairs of 12264

Each pair multiplies to 12264:

Factor 1×Factor 2=Product
1×12264=12264
2×6132=12264
3×4088=12264
4×3066=12264
6×2044=12264
7×1752=12264
8×1533=12264
12×1022=12264
14×876=12264
21×584=12264
24×511=12264
28×438=12264
42×292=12264
56×219=12264
73×168=12264
84×146=12264

Number of Divisors

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

Sum of Divisors

σ(12264) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 73 + 84 + 146 + 168 + 219 + 292 + 438 + 511 + 584 + 876 + 1022 + 1533 + 1752 + 2044 + 3066 + 4088 + 6132 + 12264 = 35520

Properties of 12264

  • 12264 is composite.
  • 12264 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 35520.

Common Divisors with Another Number?

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

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

  1. 1 divides 12264 (12264 ÷ 1 = 12264) → pair (1, 12264)
  2. 2 divides 12264 (12264 ÷ 2 = 6132) → pair (2, 6132)
  3. 3 divides 12264 (12264 ÷ 3 = 4088) → pair (3, 4088)
  4. 4 divides 12264 (12264 ÷ 4 = 3066) → pair (4, 3066)
  5. 6 divides 12264 (12264 ÷ 6 = 2044) → pair (6, 2044)
  6. 7 divides 12264 (12264 ÷ 7 = 1752) → pair (7, 1752)
  7. 8 divides 12264 (12264 ÷ 8 = 1533) → pair (8, 1533)
  8. 12 divides 12264 (12264 ÷ 12 = 1022) → pair (12, 1022)
  9. 14 divides 12264 (12264 ÷ 14 = 876) → pair (14, 876)
  10. 21 divides 12264 (12264 ÷ 21 = 584) → pair (21, 584)
  11. 24 divides 12264 (12264 ÷ 24 = 511) → pair (24, 511)
  12. 28 divides 12264 (12264 ÷ 28 = 438) → pair (28, 438)
  13. 42 divides 12264 (12264 ÷ 42 = 292) → pair (42, 292)
  14. 56 divides 12264 (12264 ÷ 56 = 219) → pair (56, 219)
  15. 73 divides 12264 (12264 ÷ 73 = 168) → pair (73, 168)
  16. 84 divides 12264 (12264 ÷ 84 = 146) → pair (84, 146)
  17. Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 73, 84, 146, 168, 219, 292, 438, 511, 584, 876, 1022, 1533, 1752, 2044, 3066, 4088, 6132, 12264} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 73 + 84 + 146 + 168 + 219 + 292 + 438 + 511 + 584 + 876 + 1022 + 1533 + 1752 + 2044 + 3066 + 4088 + 6132 + 12264 = 35520.

Nearby Examples

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

Related Operations for 12264

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