Divisors of 28416: All 36 Factors
Quick Answer
28416 has 36 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 37, 48, 64, 74, 96, 111, 128, 148, 192, 222, 256, 296, 384, 444, 592, 768, 888, 1184, 1776, 2368, 3552, 4736, 7104, 9472, 14208, 28416.
Sum: 77672.
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 28416
The number 28416 has 36 divisors:
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 37, 48, 64, 74, 96, 111, 128, 148, 192, 222, 256, 296, 384, 444, 592, 768, 888, 1184, 1776, 2368, 3552, 4736, 7104, 9472, 14208, 28416
Divisor Pairs of 28416
Each pair multiplies to 28416:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 28416 | = | 28416 |
| 2 | × | 14208 | = | 28416 |
| 3 | × | 9472 | = | 28416 |
| 4 | × | 7104 | = | 28416 |
| 6 | × | 4736 | = | 28416 |
| 8 | × | 3552 | = | 28416 |
| 12 | × | 2368 | = | 28416 |
| 16 | × | 1776 | = | 28416 |
| 24 | × | 1184 | = | 28416 |
| 32 | × | 888 | = | 28416 |
| 37 | × | 768 | = | 28416 |
| 48 | × | 592 | = | 28416 |
| 64 | × | 444 | = | 28416 |
| 74 | × | 384 | = | 28416 |
| 96 | × | 296 | = | 28416 |
| 111 | × | 256 | = | 28416 |
| 128 | × | 222 | = | 28416 |
| 148 | × | 192 | = | 28416 |
Number of Divisors
The number 28416 has 36 divisors, written as τ(28416) = 36 in number theory.
Sum of Divisors
σ(28416) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 37 + 48 + 64 + 74 + 96 + 111 + 128 + 148 + 192 + 222 + 256 + 296 + 384 + 444 + 592 + 768 + 888 + 1184 + 1776 + 2368 + 3552 + 4736 + 7104 + 9472 + 14208 + 28416 = 77672
Prime Factorization of 28416
Properties of 28416
- 28416 is composite.
- 28416 is not a perfect square.
- Number of divisors: 36.
- Sum of divisors: 77672.
Common Divisors with Another Number?
Looking for the divisors that 28416 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 28416
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √28416 ≈ 168.57. If i divides 28416, then both i and 28416/i are divisors.
- 1 divides 28416 (28416 ÷ 1 = 28416) → pair (1, 28416)
- 2 divides 28416 (28416 ÷ 2 = 14208) → pair (2, 14208)
- 3 divides 28416 (28416 ÷ 3 = 9472) → pair (3, 9472)
- 4 divides 28416 (28416 ÷ 4 = 7104) → pair (4, 7104)
- 6 divides 28416 (28416 ÷ 6 = 4736) → pair (6, 4736)
- 8 divides 28416 (28416 ÷ 8 = 3552) → pair (8, 3552)
- 12 divides 28416 (28416 ÷ 12 = 2368) → pair (12, 2368)
- 16 divides 28416 (28416 ÷ 16 = 1776) → pair (16, 1776)
- 24 divides 28416 (28416 ÷ 24 = 1184) → pair (24, 1184)
- 32 divides 28416 (28416 ÷ 32 = 888) → pair (32, 888)
- 37 divides 28416 (28416 ÷ 37 = 768) → pair (37, 768)
- 48 divides 28416 (28416 ÷ 48 = 592) → pair (48, 592)
- 64 divides 28416 (28416 ÷ 64 = 444) → pair (64, 444)
- 74 divides 28416 (28416 ÷ 74 = 384) → pair (74, 384)
- 96 divides 28416 (28416 ÷ 96 = 296) → pair (96, 296)
- 111 divides 28416 (28416 ÷ 111 = 256) → pair (111, 256)
- 128 divides 28416 (28416 ÷ 128 = 222) → pair (128, 222)
- 148 divides 28416 (28416 ÷ 148 = 192) → pair (148, 192)
- Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 37, 48, 64, 74, 96, 111, 128, 148, 192, 222, 256, 296, 384, 444, 592, 768, 888, 1184, 1776, 2368, 3552, 4736, 7104, 9472, 14208, 28416} — total 36 divisors.
- Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 37 + 48 + 64 + 74 + 96 + 111 + 128 + 148 + 192 + 222 + 256 + 296 + 384 + 444 + 592 + 768 + 888 + 1184 + 1776 + 2368 + 3552 + 4736 + 7104 + 9472 + 14208 + 28416 = 77672.
Nearby Examples
Related Operations for 28416
- Multiples of a Number — "outward" complement of divisors
- 28416 Prime Factorization — decompose into prime building blocks
- Find GCF of 28416 and another number
- Find LCM of 28416 and another number
- Is 28416 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