Divisors of 27648: All 44 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 27648

The number 27648 has 44 divisors:

1,  2,  3,  4,  6,  8,  9,  12,  16,  18,  24,  27,  32,  36,  48,  54,  64,  72,  96,  108,  128,  144,  192,  216,  256,  288,  384,  432,  512,  576,  768,  864,  1024,  1152,  1536,  1728,  2304,  3072,  3456,  4608,  6912,  9216,  13824,  27648

Divisor Pairs of 27648

Each pair multiplies to 27648:

Number of Divisors

The number 27648 has 44 divisors, written as τ(27648) = 44 in number theory.

Sum of Divisors

σ(27648) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 27 + 32 + 36 + 48 + 54 + 64 + 72 + 96 + 108 + 128 + 144 + 192 + 216 + 256 + 288 + 384 + 432 + 512 + 576 + 768 + 864 + 1024 + 1152 + 1536 + 1728 + 2304 + 3072 + 3456 + 4608 + 6912 + 9216 + 13824 + 27648 = 81880

Prime Factorization of 27648

See the full prime factorization calculator →

Properties of 27648

• 27648 is composite.
• 27648 is not a perfect square.
• Number of divisors: 44.
• Sum of divisors: 81880.

Common Divisors with Another Number?

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

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

1. 1 divides 27648 (27648 ÷ 1 = 27648) → pair (1, 27648)
2. 2 divides 27648 (27648 ÷ 2 = 13824) → pair (2, 13824)
3. 3 divides 27648 (27648 ÷ 3 = 9216) → pair (3, 9216)
4. 4 divides 27648 (27648 ÷ 4 = 6912) → pair (4, 6912)
5. 6 divides 27648 (27648 ÷ 6 = 4608) → pair (6, 4608)
6. 8 divides 27648 (27648 ÷ 8 = 3456) → pair (8, 3456)
7. 9 divides 27648 (27648 ÷ 9 = 3072) → pair (9, 3072)
8. 12 divides 27648 (27648 ÷ 12 = 2304) → pair (12, 2304)
9. 16 divides 27648 (27648 ÷ 16 = 1728) → pair (16, 1728)
10. 18 divides 27648 (27648 ÷ 18 = 1536) → pair (18, 1536)
11. 24 divides 27648 (27648 ÷ 24 = 1152) → pair (24, 1152)
12. 27 divides 27648 (27648 ÷ 27 = 1024) → pair (27, 1024)
13. 32 divides 27648 (27648 ÷ 32 = 864) → pair (32, 864)
14. 36 divides 27648 (27648 ÷ 36 = 768) → pair (36, 768)
15. 48 divides 27648 (27648 ÷ 48 = 576) → pair (48, 576)
16. 54 divides 27648 (27648 ÷ 54 = 512) → pair (54, 512)
17. 64 divides 27648 (27648 ÷ 64 = 432) → pair (64, 432)
18. 72 divides 27648 (27648 ÷ 72 = 384) → pair (72, 384)
19. 96 divides 27648 (27648 ÷ 96 = 288) → pair (96, 288)
20. 108 divides 27648 (27648 ÷ 108 = 256) → pair (108, 256)
21. 128 divides 27648 (27648 ÷ 128 = 216) → pair (128, 216)
22. 144 divides 27648 (27648 ÷ 144 = 192) → pair (144, 192)
23. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 96, 108, 128, 144, 192, 216, 256, 288, 384, 432, 512, 576, 768, 864, 1024, 1152, 1536, 1728, 2304, 3072, 3456, 4608, 6912, 9216, 13824, 27648} — total 44 divisors.
24. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 27 + 32 + 36 + 48 + 54 + 64 + 72 + 96 + 108 + 128 + 144 + 192 + 216 + 256 + 288 + 384 + 432 + 512 + 576 + 768 + 864 + 1024 + 1152 + 1536 + 1728 + 2304 + 3072 + 3456 + 4608 + 6912 + 9216 + 13824 + 27648 = 81880.

Nearby Examples

Related Operations for 27648

• Multiples of a Number — "outward" complement of divisors
• 27648 Prime Factorization — decompose into prime building blocks
• Find GCF of 27648 and another number
• Find LCM of 27648 and another number
• Is 27648 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: