Divisors of 8064: All 48 Factors

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 8064

The number 8064 has 48 divisors:

1,  2,  3,  4,  6,  7,  8,  9,  12,  14,  16,  18,  21,  24,  28,  32,  36,  42,  48,  56,  63,  64,  72,  84,  96,  112,  126,  128,  144,  168,  192,  224,  252,  288,  336,  384,  448,  504,  576,  672,  896,  1008,  1152,  1344,  2016,  2688,  4032,  8064

Divisor Pairs of 8064

Each pair multiplies to 8064:

Number of Divisors

The number 8064 has 48 divisors, written as τ(8064) = 48 in number theory.

Sum of Divisors

σ(8064) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 9 + 12 + 14 + 16 + 18 + 21 + 24 + 28 + 32 + 36 + 42 + 48 + 56 + 63 + 64 + 72 + 84 + 96 + 112 + 126 + 128 + 144 + 168 + 192 + 224 + 252 + 288 + 336 + 384 + 448 + 504 + 576 + 672 + 896 + 1008 + 1152 + 1344 + 2016 + 2688 + 4032 + 8064 = 26520

Prime Factorization of 8064

See the full prime factorization calculator →

Properties of 8064

• 8064 is composite.
• 8064 is not a perfect square.
• Number of divisors: 48.
• Sum of divisors: 26520.

Common Divisors with Another Number?

Looking for the divisors that 8064 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 8064

An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √8064 ≈ 89.80. If i divides 8064, then both i and 8064/i are divisors.

1. 1 divides 8064 (8064 ÷ 1 = 8064) → pair (1, 8064)
2. 2 divides 8064 (8064 ÷ 2 = 4032) → pair (2, 4032)
3. 3 divides 8064 (8064 ÷ 3 = 2688) → pair (3, 2688)
4. 4 divides 8064 (8064 ÷ 4 = 2016) → pair (4, 2016)
5. 6 divides 8064 (8064 ÷ 6 = 1344) → pair (6, 1344)
6. 7 divides 8064 (8064 ÷ 7 = 1152) → pair (7, 1152)
7. 8 divides 8064 (8064 ÷ 8 = 1008) → pair (8, 1008)
8. 9 divides 8064 (8064 ÷ 9 = 896) → pair (9, 896)
9. 12 divides 8064 (8064 ÷ 12 = 672) → pair (12, 672)
10. 14 divides 8064 (8064 ÷ 14 = 576) → pair (14, 576)
11. 16 divides 8064 (8064 ÷ 16 = 504) → pair (16, 504)
12. 18 divides 8064 (8064 ÷ 18 = 448) → pair (18, 448)
13. 21 divides 8064 (8064 ÷ 21 = 384) → pair (21, 384)
14. 24 divides 8064 (8064 ÷ 24 = 336) → pair (24, 336)
15. 28 divides 8064 (8064 ÷ 28 = 288) → pair (28, 288)
16. 32 divides 8064 (8064 ÷ 32 = 252) → pair (32, 252)
17. 36 divides 8064 (8064 ÷ 36 = 224) → pair (36, 224)
18. 42 divides 8064 (8064 ÷ 42 = 192) → pair (42, 192)
19. 48 divides 8064 (8064 ÷ 48 = 168) → pair (48, 168)
20. 56 divides 8064 (8064 ÷ 56 = 144) → pair (56, 144)
21. 63 divides 8064 (8064 ÷ 63 = 128) → pair (63, 128)
22. 64 divides 8064 (8064 ÷ 64 = 126) → pair (64, 126)
23. 72 divides 8064 (8064 ÷ 72 = 112) → pair (72, 112)
24. 84 divides 8064 (8064 ÷ 84 = 96) → pair (84, 96)
25. Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 16, 18, 21, 24, 28, 32, 36, 42, 48, 56, 63, 64, 72, 84, 96, 112, 126, 128, 144, 168, 192, 224, 252, 288, 336, 384, 448, 504, 576, 672, 896, 1008, 1152, 1344, 2016, 2688, 4032, 8064} — total 48 divisors.
26. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 9 + 12 + 14 + 16 + 18 + 21 + 24 + 28 + 32 + 36 + 42 + 48 + 56 + 63 + 64 + 72 + 84 + 96 + 112 + 126 + 128 + 144 + 168 + 192 + 224 + 252 + 288 + 336 + 384 + 448 + 504 + 576 + 672 + 896 + 1008 + 1152 + 1344 + 2016 + 2688 + 4032 + 8064 = 26520.

Nearby Examples

Related Operations for 8064

• Multiples of 8064 — "outward" complement; M is a multiple of 8064 ⇔ 8064 is a divisor of M
• 8064 Prime Factorization — decompose into prime building blocks
• Find GCF of 8064 and another number
• Find LCM of 8064 and another number
• Is 8064 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

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.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: