Divisors of 65170: All 32 Factors

Quick Answer

65170 has 32 divisors (factors): 1, 2, 5, 7, 10, 14, 19, 35, 38, 49, 70, 95, 98, 133, 190, 245, 266, 343, 490, 665, 686, 931, 1330, 1715, 1862, 3430, 4655, 6517, 9310, 13034, 32585, 65170.

Sum: 144000.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 5, 7, 10, 14, 19, 35, 38, 49, 70, 95, 98, 133, 190, 245, 266, 343, 490, 665, 686, 931, 1330, 1715, 1862, 3430, 4655, 6517, 9310, 13034, 32585, 65170

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 65170

The number 65170 has 32 divisors:

1,  2,  5,  7,  10,  14,  19,  35,  38,  49,  70,  95,  98,  133,  190,  245,  266,  343,  490,  665,  686,  931,  1330,  1715,  1862,  3430,  4655,  6517,  9310,  13034,  32585,  65170

Divisor Pairs of 65170

Each pair multiplies to 65170:

Factor 1×Factor 2=Product
1×65170=65170
2×32585=65170
5×13034=65170
7×9310=65170
10×6517=65170
14×4655=65170
19×3430=65170
35×1862=65170
38×1715=65170
49×1330=65170
70×931=65170
95×686=65170
98×665=65170
133×490=65170
190×343=65170
245×266=65170

Number of Divisors

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

Sum of Divisors

σ(65170) = 1 + 2 + 5 + 7 + 10 + 14 + 19 + 35 + 38 + 49 + 70 + 95 + 98 + 133 + 190 + 245 + 266 + 343 + 490 + 665 + 686 + 931 + 1330 + 1715 + 1862 + 3430 + 4655 + 6517 + 9310 + 13034 + 32585 + 65170 = 144000

Properties of 65170

  • 65170 is composite.
  • 65170 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 144000.

Common Divisors with Another Number?

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

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

  1. 1 divides 65170 (65170 ÷ 1 = 65170) → pair (1, 65170)
  2. 2 divides 65170 (65170 ÷ 2 = 32585) → pair (2, 32585)
  3. 5 divides 65170 (65170 ÷ 5 = 13034) → pair (5, 13034)
  4. 7 divides 65170 (65170 ÷ 7 = 9310) → pair (7, 9310)
  5. 10 divides 65170 (65170 ÷ 10 = 6517) → pair (10, 6517)
  6. 14 divides 65170 (65170 ÷ 14 = 4655) → pair (14, 4655)
  7. 19 divides 65170 (65170 ÷ 19 = 3430) → pair (19, 3430)
  8. 35 divides 65170 (65170 ÷ 35 = 1862) → pair (35, 1862)
  9. 38 divides 65170 (65170 ÷ 38 = 1715) → pair (38, 1715)
  10. 49 divides 65170 (65170 ÷ 49 = 1330) → pair (49, 1330)
  11. 70 divides 65170 (65170 ÷ 70 = 931) → pair (70, 931)
  12. 95 divides 65170 (65170 ÷ 95 = 686) → pair (95, 686)
  13. 98 divides 65170 (65170 ÷ 98 = 665) → pair (98, 665)
  14. 133 divides 65170 (65170 ÷ 133 = 490) → pair (133, 490)
  15. 190 divides 65170 (65170 ÷ 190 = 343) → pair (190, 343)
  16. 245 divides 65170 (65170 ÷ 245 = 266) → pair (245, 266)
  17. Collect all unique values: {1, 2, 5, 7, 10, 14, 19, 35, 38, 49, 70, 95, 98, 133, 190, 245, 266, 343, 490, 665, 686, 931, 1330, 1715, 1862, 3430, 4655, 6517, 9310, 13034, 32585, 65170} — total 32 divisors.
  18. Sum: 1 + 2 + 5 + 7 + 10 + 14 + 19 + 35 + 38 + 49 + 70 + 95 + 98 + 133 + 190 + 245 + 266 + 343 + 490 + 665 + 686 + 931 + 1330 + 1715 + 1862 + 3430 + 4655 + 6517 + 9310 + 13034 + 32585 + 65170 = 144000.

Nearby Examples

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

Related Operations for 65170

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