Divisors of 17064: All 32 Factors

Quick Answer

17064 has 32 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 79, 108, 158, 216, 237, 316, 474, 632, 711, 948, 1422, 1896, 2133, 2844, 4266, 5688, 8532, 17064.

Sum: 48000.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 79, 108, 158, 216, 237, 316, 474, 632, 711, 948, 1422, 1896, 2133, 2844, 4266, 5688, 8532, 17064

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 17064

The number 17064 has 32 divisors:

1,  2,  3,  4,  6,  8,  9,  12,  18,  24,  27,  36,  54,  72,  79,  108,  158,  216,  237,  316,  474,  632,  711,  948,  1422,  1896,  2133,  2844,  4266,  5688,  8532,  17064

Divisor Pairs of 17064

Each pair multiplies to 17064:

Factor 1×Factor 2=Product
1×17064=17064
2×8532=17064
3×5688=17064
4×4266=17064
6×2844=17064
8×2133=17064
9×1896=17064
12×1422=17064
18×948=17064
24×711=17064
27×632=17064
36×474=17064
54×316=17064
72×237=17064
79×216=17064
108×158=17064

Number of Divisors

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

Sum of Divisors

σ(17064) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 18 + 24 + 27 + 36 + 54 + 72 + 79 + 108 + 158 + 216 + 237 + 316 + 474 + 632 + 711 + 948 + 1422 + 1896 + 2133 + 2844 + 4266 + 5688 + 8532 + 17064 = 48000

Properties of 17064

  • 17064 is composite.
  • 17064 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 48000.

Common Divisors with Another Number?

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

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

  1. 1 divides 17064 (17064 ÷ 1 = 17064) → pair (1, 17064)
  2. 2 divides 17064 (17064 ÷ 2 = 8532) → pair (2, 8532)
  3. 3 divides 17064 (17064 ÷ 3 = 5688) → pair (3, 5688)
  4. 4 divides 17064 (17064 ÷ 4 = 4266) → pair (4, 4266)
  5. 6 divides 17064 (17064 ÷ 6 = 2844) → pair (6, 2844)
  6. 8 divides 17064 (17064 ÷ 8 = 2133) → pair (8, 2133)
  7. 9 divides 17064 (17064 ÷ 9 = 1896) → pair (9, 1896)
  8. 12 divides 17064 (17064 ÷ 12 = 1422) → pair (12, 1422)
  9. 18 divides 17064 (17064 ÷ 18 = 948) → pair (18, 948)
  10. 24 divides 17064 (17064 ÷ 24 = 711) → pair (24, 711)
  11. 27 divides 17064 (17064 ÷ 27 = 632) → pair (27, 632)
  12. 36 divides 17064 (17064 ÷ 36 = 474) → pair (36, 474)
  13. 54 divides 17064 (17064 ÷ 54 = 316) → pair (54, 316)
  14. 72 divides 17064 (17064 ÷ 72 = 237) → pair (72, 237)
  15. 79 divides 17064 (17064 ÷ 79 = 216) → pair (79, 216)
  16. 108 divides 17064 (17064 ÷ 108 = 158) → pair (108, 158)
  17. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 79, 108, 158, 216, 237, 316, 474, 632, 711, 948, 1422, 1896, 2133, 2844, 4266, 5688, 8532, 17064} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 18 + 24 + 27 + 36 + 54 + 72 + 79 + 108 + 158 + 216 + 237 + 316 + 474 + 632 + 711 + 948 + 1422 + 1896 + 2133 + 2844 + 4266 + 5688 + 8532 + 17064 = 48000.

Nearby Examples

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

Related Operations for 17064

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