Divisors of 80: All 10 Factors

Quick Answer

80 has 10 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80.

Sum: 186.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
10 divisors
1, 2, 4, 5, 8, 10, 16, 20, 40, 80

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 80

The number 80 has 10 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  40,  80

Divisor Pairs of 80

Each pair multiplies to 80:

Factor 1×Factor 2=Product
1×80=80
2×40=80
4×20=80
5×16=80
8×10=80

Number of Divisors

The number 80 has 10 divisors, written as τ(80) = 10 in number theory.

Sum of Divisors

σ(80) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 40 + 80 = 186

Properties of 80

  • 80 is composite.
  • 80 is not a perfect square.
  • Number of divisors: 10.
  • Sum of divisors: 186.

Common Divisors with Another Number?

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

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

  1. 1 divides 80 (80 ÷ 1 = 80) → pair (1, 80)
  2. 2 divides 80 (80 ÷ 2 = 40) → pair (2, 40)
  3. 4 divides 80 (80 ÷ 4 = 20) → pair (4, 20)
  4. 5 divides 80 (80 ÷ 5 = 16) → pair (5, 16)
  5. 8 divides 80 (80 ÷ 8 = 10) → pair (8, 10)
  6. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 40, 80} — total 10 divisors.
  7. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 40 + 80 = 186.

Nearby Examples

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

Related Operations for 80

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