Divisors of 66564: All 27 Factors

Quick Answer

66564 has 27 divisors (factors): 1, 2, 3, 4, 6, 9, 12, 18, 36, 43, 86, 129, 172, 258, 387, 516, 774, 1548, 1849, 3698, 5547, 7396, 11094, 16641, 22188, 33282, 66564.

Sum: 172263.  66564 is a perfect square (√66564 = 258).

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
27 divisors
1, 2, 3, 4, 6, 9, 12, 18, 36, 43, 86, 129, 172, 258, 387, 516, 774, 1548, 1849, 3698, 5547, 7396, 11094, 16641, 22188, 33282, 66564

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 66564

The number 66564 has 27 divisors:

1,  2,  3,  4,  6,  9,  12,  18,  36,  43,  86,  129,  172,  258,  387,  516,  774,  1548,  1849,  3698,  5547,  7396,  11094,  16641,  22188,  33282,  66564

Divisor Pairs of 66564

Each pair multiplies to 66564:

Factor 1×Factor 2=Product
1×66564=66564
2×33282=66564
3×22188=66564
4×16641=66564
6×11094=66564
9×7396=66564
12×5547=66564
18×3698=66564
36×1849=66564
43×1548=66564
86×774=66564
129×516=66564
172×387=66564
258×258=66564

Note: the last pair has identical factors (258 × 258) because 66564 is a perfect square.

Number of Divisors

The number 66564 has 27 divisors, written as τ(66564) = 27 in number theory.

Notice: 66564 has an odd number of divisors — this means 66564 is a perfect square (√66564 = 258).

Sum of Divisors

σ(66564) = 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 36 + 43 + 86 + 129 + 172 + 258 + 387 + 516 + 774 + 1548 + 1849 + 3698 + 5547 + 7396 + 11094 + 16641 + 22188 + 33282 + 66564 = 172263

Properties of 66564

  • 66564 is composite.
  • 66564 is a perfect square (√66564 = 258).
  • Number of divisors: 27.
  • Sum of divisors: 172263.

Common Divisors with Another Number?

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

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

  1. 1 divides 66564 (66564 ÷ 1 = 66564) → pair (1, 66564)
  2. 2 divides 66564 (66564 ÷ 2 = 33282) → pair (2, 33282)
  3. 3 divides 66564 (66564 ÷ 3 = 22188) → pair (3, 22188)
  4. 4 divides 66564 (66564 ÷ 4 = 16641) → pair (4, 16641)
  5. 6 divides 66564 (66564 ÷ 6 = 11094) → pair (6, 11094)
  6. 9 divides 66564 (66564 ÷ 9 = 7396) → pair (9, 7396)
  7. 12 divides 66564 (66564 ÷ 12 = 5547) → pair (12, 5547)
  8. 18 divides 66564 (66564 ÷ 18 = 3698) → pair (18, 3698)
  9. 36 divides 66564 (66564 ÷ 36 = 1849) → pair (36, 1849)
  10. 43 divides 66564 (66564 ÷ 43 = 1548) → pair (43, 1548)
  11. 86 divides 66564 (66564 ÷ 86 = 774) → pair (86, 774)
  12. 129 divides 66564 (66564 ÷ 129 = 516) → pair (129, 516)
  13. 172 divides 66564 (66564 ÷ 172 = 387) → pair (172, 387)
  14. 258 divides 66564 (66564 ÷ 258 = 258) → pair (258, 258)
  15. Collect all unique values: {1, 2, 3, 4, 6, 9, 12, 18, 36, 43, 86, 129, 172, 258, 387, 516, 774, 1548, 1849, 3698, 5547, 7396, 11094, 16641, 22188, 33282, 66564} — total 27 divisors.
  16. Sum: 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 36 + 43 + 86 + 129 + 172 + 258 + 387 + 516 + 774 + 1548 + 1849 + 3698 + 5547 + 7396 + 11094 + 16641 + 22188 + 33282 + 66564 = 172263.

Nearby Examples

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

Related Operations for 66564

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