Divisors of 159: All 4 Factors
Quick Answer
159 has 4 divisors (factors): 1, 3, 53, 159.
Sum: 216.
Divisors (Factors) Calculator
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 159
The number 159 has 4 divisors:
1, 3, 53, 159
Divisor Pairs of 159
Each pair multiplies to 159:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 159 | = | 159 |
| 3 | × | 53 | = | 159 |
Number of Divisors
The number 159 has 4 divisors, written as τ(159) = 4 in number theory.
Sum of Divisors
σ(159) = 1 + 3 + 53 + 159 = 216
Prime Factorization of 159
Properties of 159
- 159 is composite.
- 159 is not a perfect square.
- Number of divisors: 4.
- Sum of divisors: 216.
Common Divisors with Another Number?
Looking for the divisors that 159 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 159
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √159 ≈ 12.61. If i divides 159, then both i and 159/i are divisors.
- 1 divides 159 (159 ÷ 1 = 159) → pair (1, 159)
- 3 divides 159 (159 ÷ 3 = 53) → pair (3, 53)
- Collect all unique values: {1, 3, 53, 159} — total 4 divisors.
- Sum: 1 + 3 + 53 + 159 = 216.
Nearby Examples
Related Operations for 159
- Multiples of 159 — "outward" complement; M is a multiple of 159 ⇔ 159 is a divisor of M
- 159 Prime Factorization — decompose into prime building blocks
- Find GCF of 159 and another number
- Find LCM of 159 and another number
- Is 159 a perfect square? (odd divisor count ⇔ yes)
See also our tables of divisors:
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
- Multiples of a Number — "outward" complement
- Prime Factorization — product of prime divisors
- Greatest Common Factor (GCF) — largest common divisor of 2+ numbers
- Least Common Multiple (LCM) — smallest common multiple
- Is N a Perfect Square? — odd divisor count check