Divisors of 2304: All 27 Factors
Quick Answer
2304 has 27 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 64, 72, 96, 128, 144, 192, 256, 288, 384, 576, 768, 1152, 2304.
Sum: 6643. 2304 is a perfect square (√2304 = 48).
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 2304
The number 2304 has 27 divisors:
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 64, 72, 96, 128, 144, 192, 256, 288, 384, 576, 768, 1152, 2304
Divisor Pairs of 2304
Each pair multiplies to 2304:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 2304 | = | 2304 |
| 2 | × | 1152 | = | 2304 |
| 3 | × | 768 | = | 2304 |
| 4 | × | 576 | = | 2304 |
| 6 | × | 384 | = | 2304 |
| 8 | × | 288 | = | 2304 |
| 9 | × | 256 | = | 2304 |
| 12 | × | 192 | = | 2304 |
| 16 | × | 144 | = | 2304 |
| 18 | × | 128 | = | 2304 |
| 24 | × | 96 | = | 2304 |
| 32 | × | 72 | = | 2304 |
| 36 | × | 64 | = | 2304 |
| 48 | × | 48 | = | 2304 |
Note: the last pair has identical factors (48 × 48) because 2304 is a perfect square.
Number of Divisors
The number 2304 has 27 divisors, written as τ(2304) = 27 in number theory.
⚡ Notice: 2304 has an odd number of divisors — this means 2304 is a perfect square (√2304 = 48).
Sum of Divisors
σ(2304) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 32 + 36 + 48 + 64 + 72 + 96 + 128 + 144 + 192 + 256 + 288 + 384 + 576 + 768 + 1152 + 2304 = 6643
Prime Factorization of 2304
Properties of 2304
- 2304 is composite.
- 2304 is a perfect square (√2304 = 48).
- Number of divisors: 27.
- Sum of divisors: 6643.
Common Divisors with Another Number?
Looking for the divisors that 2304 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 2304
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √2304 ≈ 48.00. If i divides 2304, then both i and 2304/i are divisors.
- 1 divides 2304 (2304 ÷ 1 = 2304) → pair (1, 2304)
- 2 divides 2304 (2304 ÷ 2 = 1152) → pair (2, 1152)
- 3 divides 2304 (2304 ÷ 3 = 768) → pair (3, 768)
- 4 divides 2304 (2304 ÷ 4 = 576) → pair (4, 576)
- 6 divides 2304 (2304 ÷ 6 = 384) → pair (6, 384)
- 8 divides 2304 (2304 ÷ 8 = 288) → pair (8, 288)
- 9 divides 2304 (2304 ÷ 9 = 256) → pair (9, 256)
- 12 divides 2304 (2304 ÷ 12 = 192) → pair (12, 192)
- 16 divides 2304 (2304 ÷ 16 = 144) → pair (16, 144)
- 18 divides 2304 (2304 ÷ 18 = 128) → pair (18, 128)
- 24 divides 2304 (2304 ÷ 24 = 96) → pair (24, 96)
- 32 divides 2304 (2304 ÷ 32 = 72) → pair (32, 72)
- 36 divides 2304 (2304 ÷ 36 = 64) → pair (36, 64)
- 48 divides 2304 (2304 ÷ 48 = 48) → pair (48, 48)
- Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 64, 72, 96, 128, 144, 192, 256, 288, 384, 576, 768, 1152, 2304} — total 27 divisors.
- Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 32 + 36 + 48 + 64 + 72 + 96 + 128 + 144 + 192 + 256 + 288 + 384 + 576 + 768 + 1152 + 2304 = 6643.
Nearby Examples
Related Operations for 2304
- Multiples of 2304 — "outward" complement; M is a multiple of 2304 ⇔ 2304 is a divisor of M
- 2304 Prime Factorization — decompose into prime building blocks
- Find GCF of 2304 and another number
- Find LCM of 2304 and another number
- Is 2304 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