Divisors of 57344: All 28 Factors
Quick Answer
57344 has 28 divisors (factors): 1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 112, 128, 224, 256, 448, 512, 896, 1024, 1792, 2048, 3584, 4096, 7168, 8192, 14336, 28672, 57344.
Sum: 131064.
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 57344
The number 57344 has 28 divisors:
1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 112, 128, 224, 256, 448, 512, 896, 1024, 1792, 2048, 3584, 4096, 7168, 8192, 14336, 28672, 57344
Divisor Pairs of 57344
Each pair multiplies to 57344:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 57344 | = | 57344 |
| 2 | × | 28672 | = | 57344 |
| 4 | × | 14336 | = | 57344 |
| 7 | × | 8192 | = | 57344 |
| 8 | × | 7168 | = | 57344 |
| 14 | × | 4096 | = | 57344 |
| 16 | × | 3584 | = | 57344 |
| 28 | × | 2048 | = | 57344 |
| 32 | × | 1792 | = | 57344 |
| 56 | × | 1024 | = | 57344 |
| 64 | × | 896 | = | 57344 |
| 112 | × | 512 | = | 57344 |
| 128 | × | 448 | = | 57344 |
| 224 | × | 256 | = | 57344 |
Number of Divisors
The number 57344 has 28 divisors, written as τ(57344) = 28 in number theory.
Sum of Divisors
σ(57344) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 56 + 64 + 112 + 128 + 224 + 256 + 448 + 512 + 896 + 1024 + 1792 + 2048 + 3584 + 4096 + 7168 + 8192 + 14336 + 28672 + 57344 = 131064
Prime Factorization of 57344
Properties of 57344
- 57344 is composite.
- 57344 is not a perfect square.
- Number of divisors: 28.
- Sum of divisors: 131064.
Common Divisors with Another Number?
Looking for the divisors that 57344 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 57344
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √57344 ≈ 239.47. If i divides 57344, then both i and 57344/i are divisors.
- 1 divides 57344 (57344 ÷ 1 = 57344) → pair (1, 57344)
- 2 divides 57344 (57344 ÷ 2 = 28672) → pair (2, 28672)
- 4 divides 57344 (57344 ÷ 4 = 14336) → pair (4, 14336)
- 7 divides 57344 (57344 ÷ 7 = 8192) → pair (7, 8192)
- 8 divides 57344 (57344 ÷ 8 = 7168) → pair (8, 7168)
- 14 divides 57344 (57344 ÷ 14 = 4096) → pair (14, 4096)
- 16 divides 57344 (57344 ÷ 16 = 3584) → pair (16, 3584)
- 28 divides 57344 (57344 ÷ 28 = 2048) → pair (28, 2048)
- 32 divides 57344 (57344 ÷ 32 = 1792) → pair (32, 1792)
- 56 divides 57344 (57344 ÷ 56 = 1024) → pair (56, 1024)
- 64 divides 57344 (57344 ÷ 64 = 896) → pair (64, 896)
- 112 divides 57344 (57344 ÷ 112 = 512) → pair (112, 512)
- 128 divides 57344 (57344 ÷ 128 = 448) → pair (128, 448)
- 224 divides 57344 (57344 ÷ 224 = 256) → pair (224, 256)
- Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 112, 128, 224, 256, 448, 512, 896, 1024, 1792, 2048, 3584, 4096, 7168, 8192, 14336, 28672, 57344} — total 28 divisors.
- Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 56 + 64 + 112 + 128 + 224 + 256 + 448 + 512 + 896 + 1024 + 1792 + 2048 + 3584 + 4096 + 7168 + 8192 + 14336 + 28672 + 57344 = 131064.
Nearby Examples
Related Operations for 57344
- Multiples of a Number — "outward" complement of divisors
- 57344 Prime Factorization — decompose into prime building blocks
- Find GCF of 57344 and another number
- Find LCM of 57344 and another number
- Is 57344 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