Divisors of 136: All 8 Factors

Quick Answer

136 has 8 divisors (factors): 1, 2, 4, 8, 17, 34, 68, 136.

Sum: 270.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
8 divisors
1, 2, 4, 8, 17, 34, 68, 136

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 136

The number 136 has 8 divisors:

1,  2,  4,  8,  17,  34,  68,  136

Divisor Pairs of 136

Each pair multiplies to 136:

Factor 1×Factor 2=Product
1×136=136
2×68=136
4×34=136
8×17=136

Number of Divisors

The number 136 has 8 divisors, written as τ(136) = 8 in number theory.

Sum of Divisors

σ(136) = 1 + 2 + 4 + 8 + 17 + 34 + 68 + 136 = 270

Properties of 136

  • 136 is composite.
  • 136 is not a perfect square.
  • Number of divisors: 8.
  • Sum of divisors: 270.

Common Divisors with Another Number?

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

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

  1. 1 divides 136 (136 ÷ 1 = 136) → pair (1, 136)
  2. 2 divides 136 (136 ÷ 2 = 68) → pair (2, 68)
  3. 4 divides 136 (136 ÷ 4 = 34) → pair (4, 34)
  4. 8 divides 136 (136 ÷ 8 = 17) → pair (8, 17)
  5. Collect all unique values: {1, 2, 4, 8, 17, 34, 68, 136} — total 8 divisors.
  6. Sum: 1 + 2 + 4 + 8 + 17 + 34 + 68 + 136 = 270.

Nearby Examples

ndivisors countsum σ(n)
14415403
12016360
1009217
18018546
9012234
8412224
7212195
6012168

Related Operations for 136

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