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