Divisors of 128: All 8 Factors

Quick Answer

128 has 8 divisors (factors): 1, 2, 4, 8, 16, 32, 64, 128.

Sum: 255.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
8 divisors
1, 2, 4, 8, 16, 32, 64, 128

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 128

The number 128 has 8 divisors:

1,  2,  4,  8,  16,  32,  64,  128

Divisor Pairs of 128

Each pair multiplies to 128:

Factor 1×Factor 2=Product
1×128=128
2×64=128
4×32=128
8×16=128

Number of Divisors

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

Sum of Divisors

σ(128) = 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 = 255

Properties of 128

  • 128 is composite.
  • 128 is not a perfect square.
  • Number of divisors: 8.
  • Sum of divisors: 255.

Common Divisors with Another Number?

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

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

  1. 1 divides 128 (128 ÷ 1 = 128) → pair (1, 128)
  2. 2 divides 128 (128 ÷ 2 = 64) → pair (2, 64)
  3. 4 divides 128 (128 ÷ 4 = 32) → pair (4, 32)
  4. 8 divides 128 (128 ÷ 8 = 16) → pair (8, 16)
  5. Collect all unique values: {1, 2, 4, 8, 16, 32, 64, 128} — total 8 divisors.
  6. Sum: 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 = 255.

Nearby Examples

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

Related Operations for 128

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