Divisors of 59094: All 36 Factors

Quick Answer

59094 has 36 divisors (factors): 1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 49, 63, 67, 98, 126, 134, 147, 201, 294, 402, 441, 469, 603, 882, 938, 1206, 1407, 2814, 3283, 4221, 6566, 8442, 9849, 19698, 29547, 59094.

Sum: 151164.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 49, 63, 67, 98, 126, 134, 147, 201, 294, 402, 441, 469, 603, 882, 938, 1206, 1407, 2814, 3283, 4221, 6566, 8442, 9849, 19698, 29547, 59094

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 59094

The number 59094 has 36 divisors:

1,  2,  3,  6,  7,  9,  14,  18,  21,  42,  49,  63,  67,  98,  126,  134,  147,  201,  294,  402,  441,  469,  603,  882,  938,  1206,  1407,  2814,  3283,  4221,  6566,  8442,  9849,  19698,  29547,  59094

Divisor Pairs of 59094

Each pair multiplies to 59094:

Factor 1×Factor 2=Product
1×59094=59094
2×29547=59094
3×19698=59094
6×9849=59094
7×8442=59094
9×6566=59094
14×4221=59094
18×3283=59094
21×2814=59094
42×1407=59094
49×1206=59094
63×938=59094
67×882=59094
98×603=59094
126×469=59094
134×441=59094
147×402=59094
201×294=59094

Number of Divisors

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

Sum of Divisors

σ(59094) = 1 + 2 + 3 + 6 + 7 + 9 + 14 + 18 + 21 + 42 + 49 + 63 + 67 + 98 + 126 + 134 + 147 + 201 + 294 + 402 + 441 + 469 + 603 + 882 + 938 + 1206 + 1407 + 2814 + 3283 + 4221 + 6566 + 8442 + 9849 + 19698 + 29547 + 59094 = 151164

Properties of 59094

  • 59094 is composite.
  • 59094 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 151164.

Common Divisors with Another Number?

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

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

  1. 1 divides 59094 (59094 ÷ 1 = 59094) → pair (1, 59094)
  2. 2 divides 59094 (59094 ÷ 2 = 29547) → pair (2, 29547)
  3. 3 divides 59094 (59094 ÷ 3 = 19698) → pair (3, 19698)
  4. 6 divides 59094 (59094 ÷ 6 = 9849) → pair (6, 9849)
  5. 7 divides 59094 (59094 ÷ 7 = 8442) → pair (7, 8442)
  6. 9 divides 59094 (59094 ÷ 9 = 6566) → pair (9, 6566)
  7. 14 divides 59094 (59094 ÷ 14 = 4221) → pair (14, 4221)
  8. 18 divides 59094 (59094 ÷ 18 = 3283) → pair (18, 3283)
  9. 21 divides 59094 (59094 ÷ 21 = 2814) → pair (21, 2814)
  10. 42 divides 59094 (59094 ÷ 42 = 1407) → pair (42, 1407)
  11. 49 divides 59094 (59094 ÷ 49 = 1206) → pair (49, 1206)
  12. 63 divides 59094 (59094 ÷ 63 = 938) → pair (63, 938)
  13. 67 divides 59094 (59094 ÷ 67 = 882) → pair (67, 882)
  14. 98 divides 59094 (59094 ÷ 98 = 603) → pair (98, 603)
  15. 126 divides 59094 (59094 ÷ 126 = 469) → pair (126, 469)
  16. 134 divides 59094 (59094 ÷ 134 = 441) → pair (134, 441)
  17. 147 divides 59094 (59094 ÷ 147 = 402) → pair (147, 402)
  18. 201 divides 59094 (59094 ÷ 201 = 294) → pair (201, 294)
  19. Collect all unique values: {1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 49, 63, 67, 98, 126, 134, 147, 201, 294, 402, 441, 469, 603, 882, 938, 1206, 1407, 2814, 3283, 4221, 6566, 8442, 9849, 19698, 29547, 59094} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 6 + 7 + 9 + 14 + 18 + 21 + 42 + 49 + 63 + 67 + 98 + 126 + 134 + 147 + 201 + 294 + 402 + 441 + 469 + 603 + 882 + 938 + 1206 + 1407 + 2814 + 3283 + 4221 + 6566 + 8442 + 9849 + 19698 + 29547 + 59094 = 151164.

Nearby Examples

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

Related Operations for 59094

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