Divisors of 17052: All 36 Factors

Quick Answer

17052 has 36 divisors (factors): 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 29, 42, 49, 58, 84, 87, 98, 116, 147, 174, 196, 203, 294, 348, 406, 588, 609, 812, 1218, 1421, 2436, 2842, 4263, 5684, 8526, 17052.

Sum: 47880.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 29, 42, 49, 58, 84, 87, 98, 116, 147, 174, 196, 203, 294, 348, 406, 588, 609, 812, 1218, 1421, 2436, 2842, 4263, 5684, 8526, 17052

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 17052

The number 17052 has 36 divisors:

1,  2,  3,  4,  6,  7,  12,  14,  21,  28,  29,  42,  49,  58,  84,  87,  98,  116,  147,  174,  196,  203,  294,  348,  406,  588,  609,  812,  1218,  1421,  2436,  2842,  4263,  5684,  8526,  17052

Divisor Pairs of 17052

Each pair multiplies to 17052:

Factor 1×Factor 2=Product
1×17052=17052
2×8526=17052
3×5684=17052
4×4263=17052
6×2842=17052
7×2436=17052
12×1421=17052
14×1218=17052
21×812=17052
28×609=17052
29×588=17052
42×406=17052
49×348=17052
58×294=17052
84×203=17052
87×196=17052
98×174=17052
116×147=17052

Number of Divisors

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

Sum of Divisors

σ(17052) = 1 + 2 + 3 + 4 + 6 + 7 + 12 + 14 + 21 + 28 + 29 + 42 + 49 + 58 + 84 + 87 + 98 + 116 + 147 + 174 + 196 + 203 + 294 + 348 + 406 + 588 + 609 + 812 + 1218 + 1421 + 2436 + 2842 + 4263 + 5684 + 8526 + 17052 = 47880

Properties of 17052

  • 17052 is composite.
  • 17052 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 47880.

Common Divisors with Another Number?

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

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

  1. 1 divides 17052 (17052 ÷ 1 = 17052) → pair (1, 17052)
  2. 2 divides 17052 (17052 ÷ 2 = 8526) → pair (2, 8526)
  3. 3 divides 17052 (17052 ÷ 3 = 5684) → pair (3, 5684)
  4. 4 divides 17052 (17052 ÷ 4 = 4263) → pair (4, 4263)
  5. 6 divides 17052 (17052 ÷ 6 = 2842) → pair (6, 2842)
  6. 7 divides 17052 (17052 ÷ 7 = 2436) → pair (7, 2436)
  7. 12 divides 17052 (17052 ÷ 12 = 1421) → pair (12, 1421)
  8. 14 divides 17052 (17052 ÷ 14 = 1218) → pair (14, 1218)
  9. 21 divides 17052 (17052 ÷ 21 = 812) → pair (21, 812)
  10. 28 divides 17052 (17052 ÷ 28 = 609) → pair (28, 609)
  11. 29 divides 17052 (17052 ÷ 29 = 588) → pair (29, 588)
  12. 42 divides 17052 (17052 ÷ 42 = 406) → pair (42, 406)
  13. 49 divides 17052 (17052 ÷ 49 = 348) → pair (49, 348)
  14. 58 divides 17052 (17052 ÷ 58 = 294) → pair (58, 294)
  15. 84 divides 17052 (17052 ÷ 84 = 203) → pair (84, 203)
  16. 87 divides 17052 (17052 ÷ 87 = 196) → pair (87, 196)
  17. 98 divides 17052 (17052 ÷ 98 = 174) → pair (98, 174)
  18. 116 divides 17052 (17052 ÷ 116 = 147) → pair (116, 147)
  19. Collect all unique values: {1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 29, 42, 49, 58, 84, 87, 98, 116, 147, 174, 196, 203, 294, 348, 406, 588, 609, 812, 1218, 1421, 2436, 2842, 4263, 5684, 8526, 17052} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 12 + 14 + 21 + 28 + 29 + 42 + 49 + 58 + 84 + 87 + 98 + 116 + 147 + 174 + 196 + 203 + 294 + 348 + 406 + 588 + 609 + 812 + 1218 + 1421 + 2436 + 2842 + 4263 + 5684 + 8526 + 17052 = 47880.

Nearby Examples

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

Related Operations for 17052

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