Divisors of 16128: All 54 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 16128

The number 16128 has 54 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,  256,  288,  336,  384,  448,  504,  576,  672,  768,  896,  1008,  1152,  1344,  1792,  2016,  2304,  2688,  4032,  5376,  8064,  16128

Divisor Pairs of 16128

Each pair multiplies to 16128:

Number of Divisors

The number 16128 has 54 divisors, written as τ(16128) = 54 in number theory.

Sum of Divisors

σ(16128) = 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 + 256 + 288 + 336 + 384 + 448 + 504 + 576 + 672 + 768 + 896 + 1008 + 1152 + 1344 + 1792 + 2016 + 2304 + 2688 + 4032 + 5376 + 8064 + 16128 = 53144

Prime Factorization of 16128

See the full prime factorization calculator →

Properties of 16128

• 16128 is composite.
• 16128 is not a perfect square.
• Number of divisors: 54.
• Sum of divisors: 53144.

Common Divisors with Another Number?

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

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

1. 1 divides 16128 (16128 ÷ 1 = 16128) → pair (1, 16128)
2. 2 divides 16128 (16128 ÷ 2 = 8064) → pair (2, 8064)
3. 3 divides 16128 (16128 ÷ 3 = 5376) → pair (3, 5376)
4. 4 divides 16128 (16128 ÷ 4 = 4032) → pair (4, 4032)
5. 6 divides 16128 (16128 ÷ 6 = 2688) → pair (6, 2688)
6. 7 divides 16128 (16128 ÷ 7 = 2304) → pair (7, 2304)
7. 8 divides 16128 (16128 ÷ 8 = 2016) → pair (8, 2016)
8. 9 divides 16128 (16128 ÷ 9 = 1792) → pair (9, 1792)
9. 12 divides 16128 (16128 ÷ 12 = 1344) → pair (12, 1344)
10. 14 divides 16128 (16128 ÷ 14 = 1152) → pair (14, 1152)
11. 16 divides 16128 (16128 ÷ 16 = 1008) → pair (16, 1008)
12. 18 divides 16128 (16128 ÷ 18 = 896) → pair (18, 896)
13. 21 divides 16128 (16128 ÷ 21 = 768) → pair (21, 768)
14. 24 divides 16128 (16128 ÷ 24 = 672) → pair (24, 672)
15. 28 divides 16128 (16128 ÷ 28 = 576) → pair (28, 576)
16. 32 divides 16128 (16128 ÷ 32 = 504) → pair (32, 504)
17. 36 divides 16128 (16128 ÷ 36 = 448) → pair (36, 448)
18. 42 divides 16128 (16128 ÷ 42 = 384) → pair (42, 384)
19. 48 divides 16128 (16128 ÷ 48 = 336) → pair (48, 336)
20. 56 divides 16128 (16128 ÷ 56 = 288) → pair (56, 288)
21. 63 divides 16128 (16128 ÷ 63 = 256) → pair (63, 256)
22. 64 divides 16128 (16128 ÷ 64 = 252) → pair (64, 252)
23. 72 divides 16128 (16128 ÷ 72 = 224) → pair (72, 224)
24. 84 divides 16128 (16128 ÷ 84 = 192) → pair (84, 192)
25. 96 divides 16128 (16128 ÷ 96 = 168) → pair (96, 168)
26. 112 divides 16128 (16128 ÷ 112 = 144) → pair (112, 144)
27. 126 divides 16128 (16128 ÷ 126 = 128) → pair (126, 128)
28. 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, 256, 288, 336, 384, 448, 504, 576, 672, 768, 896, 1008, 1152, 1344, 1792, 2016, 2304, 2688, 4032, 5376, 8064, 16128} — total 54 divisors.
29. 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 + 256 + 288 + 336 + 384 + 448 + 504 + 576 + 672 + 768 + 896 + 1008 + 1152 + 1344 + 1792 + 2016 + 2304 + 2688 + 4032 + 5376 + 8064 + 16128 = 53144.

Nearby Examples

Related Operations for 16128

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