Divisors of 33152: All 32 Factors
Quick Answer
33152 has 32 divisors (factors): 1, 2, 4, 7, 8, 14, 16, 28, 32, 37, 56, 64, 74, 112, 128, 148, 224, 259, 296, 448, 518, 592, 896, 1036, 1184, 2072, 2368, 4144, 4736, 8288, 16576, 33152.
Sum: 77520.
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 33152
The number 33152 has 32 divisors:
1, 2, 4, 7, 8, 14, 16, 28, 32, 37, 56, 64, 74, 112, 128, 148, 224, 259, 296, 448, 518, 592, 896, 1036, 1184, 2072, 2368, 4144, 4736, 8288, 16576, 33152
Divisor Pairs of 33152
Each pair multiplies to 33152:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 33152 | = | 33152 |
| 2 | × | 16576 | = | 33152 |
| 4 | × | 8288 | = | 33152 |
| 7 | × | 4736 | = | 33152 |
| 8 | × | 4144 | = | 33152 |
| 14 | × | 2368 | = | 33152 |
| 16 | × | 2072 | = | 33152 |
| 28 | × | 1184 | = | 33152 |
| 32 | × | 1036 | = | 33152 |
| 37 | × | 896 | = | 33152 |
| 56 | × | 592 | = | 33152 |
| 64 | × | 518 | = | 33152 |
| 74 | × | 448 | = | 33152 |
| 112 | × | 296 | = | 33152 |
| 128 | × | 259 | = | 33152 |
| 148 | × | 224 | = | 33152 |
Number of Divisors
The number 33152 has 32 divisors, written as τ(33152) = 32 in number theory.
Sum of Divisors
σ(33152) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 37 + 56 + 64 + 74 + 112 + 128 + 148 + 224 + 259 + 296 + 448 + 518 + 592 + 896 + 1036 + 1184 + 2072 + 2368 + 4144 + 4736 + 8288 + 16576 + 33152 = 77520
Prime Factorization of 33152
Properties of 33152
- 33152 is composite.
- 33152 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 77520.
Common Divisors with Another Number?
Looking for the divisors that 33152 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 33152
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √33152 ≈ 182.08. If i divides 33152, then both i and 33152/i are divisors.
- 1 divides 33152 (33152 ÷ 1 = 33152) → pair (1, 33152)
- 2 divides 33152 (33152 ÷ 2 = 16576) → pair (2, 16576)
- 4 divides 33152 (33152 ÷ 4 = 8288) → pair (4, 8288)
- 7 divides 33152 (33152 ÷ 7 = 4736) → pair (7, 4736)
- 8 divides 33152 (33152 ÷ 8 = 4144) → pair (8, 4144)
- 14 divides 33152 (33152 ÷ 14 = 2368) → pair (14, 2368)
- 16 divides 33152 (33152 ÷ 16 = 2072) → pair (16, 2072)
- 28 divides 33152 (33152 ÷ 28 = 1184) → pair (28, 1184)
- 32 divides 33152 (33152 ÷ 32 = 1036) → pair (32, 1036)
- 37 divides 33152 (33152 ÷ 37 = 896) → pair (37, 896)
- 56 divides 33152 (33152 ÷ 56 = 592) → pair (56, 592)
- 64 divides 33152 (33152 ÷ 64 = 518) → pair (64, 518)
- 74 divides 33152 (33152 ÷ 74 = 448) → pair (74, 448)
- 112 divides 33152 (33152 ÷ 112 = 296) → pair (112, 296)
- 128 divides 33152 (33152 ÷ 128 = 259) → pair (128, 259)
- 148 divides 33152 (33152 ÷ 148 = 224) → pair (148, 224)
- Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 28, 32, 37, 56, 64, 74, 112, 128, 148, 224, 259, 296, 448, 518, 592, 896, 1036, 1184, 2072, 2368, 4144, 4736, 8288, 16576, 33152} — total 32 divisors.
- Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 37 + 56 + 64 + 74 + 112 + 128 + 148 + 224 + 259 + 296 + 448 + 518 + 592 + 896 + 1036 + 1184 + 2072 + 2368 + 4144 + 4736 + 8288 + 16576 + 33152 = 77520.
Nearby Examples
Related Operations for 33152
- Multiples of a Number — "outward" complement of divisors
- 33152 Prime Factorization — decompose into prime building blocks
- Find GCF of 33152 and another number
- Find LCM of 33152 and another number
- Is 33152 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