Divisors of 153: All 6 Factors
Quick Answer
153 has 6 divisors (factors): 1, 3, 9, 17, 51, 153.
Sum: 234.
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 153
The number 153 has 6 divisors:
1, 3, 9, 17, 51, 153
Divisor Pairs of 153
Each pair multiplies to 153:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 153 | = | 153 |
| 3 | × | 51 | = | 153 |
| 9 | × | 17 | = | 153 |
Number of Divisors
The number 153 has 6 divisors, written as τ(153) = 6 in number theory.
Sum of Divisors
σ(153) = 1 + 3 + 9 + 17 + 51 + 153 = 234
Prime Factorization of 153
Properties of 153
- 153 is composite.
- 153 is not a perfect square.
- Number of divisors: 6.
- Sum of divisors: 234.
Common Divisors with Another Number?
Looking for the divisors that 153 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 153
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √153 ≈ 12.37. If i divides 153, then both i and 153/i are divisors.
- 1 divides 153 (153 ÷ 1 = 153) → pair (1, 153)
- 3 divides 153 (153 ÷ 3 = 51) → pair (3, 51)
- 9 divides 153 (153 ÷ 9 = 17) → pair (9, 17)
- Collect all unique values: {1, 3, 9, 17, 51, 153} — total 6 divisors.
- Sum: 1 + 3 + 9 + 17 + 51 + 153 = 234.
Nearby Examples
Related Operations for 153
- Multiples of 153 — "outward" complement; M is a multiple of 153 ⇔ 153 is a divisor of M
- 153 Prime Factorization — decompose into prime building blocks
- Find GCF of 153 and another number
- Find LCM of 153 and another number
- Is 153 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