Divisors of 59049: All 11 Factors

Quick Answer

59049 has 11 divisors (factors): 1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049.

Sum: 88573.  59049 is a perfect square (√59049 = 243).

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
11 divisors
1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049

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 59049

The number 59049 has 11 divisors:

1,  3,  9,  27,  81,  243,  729,  2187,  6561,  19683,  59049

Divisor Pairs of 59049

Each pair multiplies to 59049:

Factor 1×Factor 2=Product
1×59049=59049
3×19683=59049
9×6561=59049
27×2187=59049
81×729=59049
243×243=59049

Note: the last pair has identical factors (243 × 243) because 59049 is a perfect square.

Number of Divisors

The number 59049 has 11 divisors, written as τ(59049) = 11 in number theory.

Notice: 59049 has an odd number of divisors — this means 59049 is a perfect square (√59049 = 243).

Sum of Divisors

σ(59049) = 1 + 3 + 9 + 27 + 81 + 243 + 729 + 2187 + 6561 + 19683 + 59049 = 88573

Properties of 59049

  • 59049 is composite.
  • 59049 is a perfect square (√59049 = 243).
  • Number of divisors: 11.
  • Sum of divisors: 88573.

Common Divisors with Another Number?

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

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

  1. 1 divides 59049 (59049 ÷ 1 = 59049) → pair (1, 59049)
  2. 3 divides 59049 (59049 ÷ 3 = 19683) → pair (3, 19683)
  3. 9 divides 59049 (59049 ÷ 9 = 6561) → pair (9, 6561)
  4. 27 divides 59049 (59049 ÷ 27 = 2187) → pair (27, 2187)
  5. 81 divides 59049 (59049 ÷ 81 = 729) → pair (81, 729)
  6. 243 divides 59049 (59049 ÷ 243 = 243) → pair (243, 243)
  7. Collect all unique values: {1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049} — total 11 divisors.
  8. Sum: 1 + 3 + 9 + 27 + 81 + 243 + 729 + 2187 + 6561 + 19683 + 59049 = 88573.

Nearby Examples

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

Related Operations for 59049

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