Divisors of 59346: All 32 Factors

Quick Answer

59346 has 32 divisors (factors): 1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 42, 54, 63, 126, 157, 189, 314, 378, 471, 942, 1099, 1413, 2198, 2826, 3297, 4239, 6594, 8478, 9891, 19782, 29673, 59346.

Sum: 151680.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 42, 54, 63, 126, 157, 189, 314, 378, 471, 942, 1099, 1413, 2198, 2826, 3297, 4239, 6594, 8478, 9891, 19782, 29673, 59346

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 59346

The number 59346 has 32 divisors:

1,  2,  3,  6,  7,  9,  14,  18,  21,  27,  42,  54,  63,  126,  157,  189,  314,  378,  471,  942,  1099,  1413,  2198,  2826,  3297,  4239,  6594,  8478,  9891,  19782,  29673,  59346

Divisor Pairs of 59346

Each pair multiplies to 59346:

Factor 1×Factor 2=Product
1×59346=59346
2×29673=59346
3×19782=59346
6×9891=59346
7×8478=59346
9×6594=59346
14×4239=59346
18×3297=59346
21×2826=59346
27×2198=59346
42×1413=59346
54×1099=59346
63×942=59346
126×471=59346
157×378=59346
189×314=59346

Number of Divisors

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

Sum of Divisors

σ(59346) = 1 + 2 + 3 + 6 + 7 + 9 + 14 + 18 + 21 + 27 + 42 + 54 + 63 + 126 + 157 + 189 + 314 + 378 + 471 + 942 + 1099 + 1413 + 2198 + 2826 + 3297 + 4239 + 6594 + 8478 + 9891 + 19782 + 29673 + 59346 = 151680

Properties of 59346

  • 59346 is composite.
  • 59346 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 151680.

Common Divisors with Another Number?

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

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

  1. 1 divides 59346 (59346 ÷ 1 = 59346) → pair (1, 59346)
  2. 2 divides 59346 (59346 ÷ 2 = 29673) → pair (2, 29673)
  3. 3 divides 59346 (59346 ÷ 3 = 19782) → pair (3, 19782)
  4. 6 divides 59346 (59346 ÷ 6 = 9891) → pair (6, 9891)
  5. 7 divides 59346 (59346 ÷ 7 = 8478) → pair (7, 8478)
  6. 9 divides 59346 (59346 ÷ 9 = 6594) → pair (9, 6594)
  7. 14 divides 59346 (59346 ÷ 14 = 4239) → pair (14, 4239)
  8. 18 divides 59346 (59346 ÷ 18 = 3297) → pair (18, 3297)
  9. 21 divides 59346 (59346 ÷ 21 = 2826) → pair (21, 2826)
  10. 27 divides 59346 (59346 ÷ 27 = 2198) → pair (27, 2198)
  11. 42 divides 59346 (59346 ÷ 42 = 1413) → pair (42, 1413)
  12. 54 divides 59346 (59346 ÷ 54 = 1099) → pair (54, 1099)
  13. 63 divides 59346 (59346 ÷ 63 = 942) → pair (63, 942)
  14. 126 divides 59346 (59346 ÷ 126 = 471) → pair (126, 471)
  15. 157 divides 59346 (59346 ÷ 157 = 378) → pair (157, 378)
  16. 189 divides 59346 (59346 ÷ 189 = 314) → pair (189, 314)
  17. Collect all unique values: {1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 42, 54, 63, 126, 157, 189, 314, 378, 471, 942, 1099, 1413, 2198, 2826, 3297, 4239, 6594, 8478, 9891, 19782, 29673, 59346} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 6 + 7 + 9 + 14 + 18 + 21 + 27 + 42 + 54 + 63 + 126 + 157 + 189 + 314 + 378 + 471 + 942 + 1099 + 1413 + 2198 + 2826 + 3297 + 4239 + 6594 + 8478 + 9891 + 19782 + 29673 + 59346 = 151680.

Nearby Examples

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

Related Operations for 59346

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