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