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