Divisors of 81: All 5 Factors

Quick Answer

81 has 5 divisors (factors): 1, 3, 9, 27, 81.

Sum: 121.  81 is a perfect square (√81 = 9).

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
5 divisors
1, 3, 9, 27, 81

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 81

The number 81 has 5 divisors:

1,  3,  9,  27,  81

Divisor Pairs of 81

Each pair multiplies to 81:

Factor 1×Factor 2=Product
1×81=81
3×27=81
9×9=81

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

Number of Divisors

The number 81 has 5 divisors, written as τ(81) = 5 in number theory.

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

Sum of Divisors

σ(81) = 1 + 3 + 9 + 27 + 81 = 121

Properties of 81

  • 81 is composite.
  • 81 is a perfect square (√81 = 9).
  • Number of divisors: 5.
  • Sum of divisors: 121.

Common Divisors with Another Number?

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

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

  1. 1 divides 81 (81 ÷ 1 = 81) → pair (1, 81)
  2. 3 divides 81 (81 ÷ 3 = 27) → pair (3, 27)
  3. 9 divides 81 (81 ÷ 9 = 9) → pair (9, 9)
  4. Collect all unique values: {1, 3, 9, 27, 81} — total 5 divisors.
  5. Sum: 1 + 3 + 9 + 27 + 81 = 121.

Nearby Examples

ndivisors countsum σ(n)
8412224
7212195
9012234
1009217
6012168
4810124
12016360
36991

Related Operations for 81

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