Divisors of 32640: All 64 Factors
Quick Answer
32640 has 64 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 32, 34, 40, 48, 51, 60, 64, 68, 80, 85, 96, 102, 120, 128, 136, 160, 170, 192, 204, 240, 255, 272, 320, 340, 384, 408, 480, 510, 544, 640, 680, 816, 960, 1020, 1088, 1360, 1632, 1920, 2040, 2176, 2720, 3264, 4080, 5440, 6528, 8160, 10880, 16320, 32640.
Sum: 110160.
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 32640
The number 32640 has 64 divisors:
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 32, 34, 40, 48, 51, 60, 64, 68, 80, 85, 96, 102, 120, 128, 136, 160, 170, 192, 204, 240, 255, 272, 320, 340, 384, 408, 480, 510, 544, 640, 680, 816, 960, 1020, 1088, 1360, 1632, 1920, 2040, 2176, 2720, 3264, 4080, 5440, 6528, 8160, 10880, 16320, 32640
Divisor Pairs of 32640
Each pair multiplies to 32640:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 32640 | = | 32640 |
| 2 | × | 16320 | = | 32640 |
| 3 | × | 10880 | = | 32640 |
| 4 | × | 8160 | = | 32640 |
| 5 | × | 6528 | = | 32640 |
| 6 | × | 5440 | = | 32640 |
| 8 | × | 4080 | = | 32640 |
| 10 | × | 3264 | = | 32640 |
| 12 | × | 2720 | = | 32640 |
| 15 | × | 2176 | = | 32640 |
| 16 | × | 2040 | = | 32640 |
| 17 | × | 1920 | = | 32640 |
| 20 | × | 1632 | = | 32640 |
| 24 | × | 1360 | = | 32640 |
| 30 | × | 1088 | = | 32640 |
| 32 | × | 1020 | = | 32640 |
| 34 | × | 960 | = | 32640 |
| 40 | × | 816 | = | 32640 |
| 48 | × | 680 | = | 32640 |
| 51 | × | 640 | = | 32640 |
| 60 | × | 544 | = | 32640 |
| 64 | × | 510 | = | 32640 |
| 68 | × | 480 | = | 32640 |
| 80 | × | 408 | = | 32640 |
| 85 | × | 384 | = | 32640 |
| 96 | × | 340 | = | 32640 |
| 102 | × | 320 | = | 32640 |
| 120 | × | 272 | = | 32640 |
| 128 | × | 255 | = | 32640 |
| 136 | × | 240 | = | 32640 |
| 160 | × | 204 | = | 32640 |
| 170 | × | 192 | = | 32640 |
Number of Divisors
The number 32640 has 64 divisors, written as τ(32640) = 64 in number theory.
Sum of Divisors
σ(32640) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 17 + 20 + 24 + 30 + 32 + 34 + 40 + 48 + 51 + 60 + 64 + 68 + 80 + 85 + 96 + 102 + 120 + 128 + 136 + 160 + 170 + 192 + 204 + 240 + 255 + 272 + 320 + 340 + 384 + 408 + 480 + 510 + 544 + 640 + 680 + 816 + 960 + 1020 + 1088 + 1360 + 1632 + 1920 + 2040 + 2176 + 2720 + 3264 + 4080 + 5440 + 6528 + 8160 + 10880 + 16320 + 32640 = 110160
Prime Factorization of 32640
Properties of 32640
- 32640 is composite.
- 32640 is not a perfect square.
- Number of divisors: 64.
- Sum of divisors: 110160.
Common Divisors with Another Number?
Looking for the divisors that 32640 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 32640
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √32640 ≈ 180.67. If i divides 32640, then both i and 32640/i are divisors.
- 1 divides 32640 (32640 ÷ 1 = 32640) → pair (1, 32640)
- 2 divides 32640 (32640 ÷ 2 = 16320) → pair (2, 16320)
- 3 divides 32640 (32640 ÷ 3 = 10880) → pair (3, 10880)
- 4 divides 32640 (32640 ÷ 4 = 8160) → pair (4, 8160)
- 5 divides 32640 (32640 ÷ 5 = 6528) → pair (5, 6528)
- 6 divides 32640 (32640 ÷ 6 = 5440) → pair (6, 5440)
- 8 divides 32640 (32640 ÷ 8 = 4080) → pair (8, 4080)
- 10 divides 32640 (32640 ÷ 10 = 3264) → pair (10, 3264)
- 12 divides 32640 (32640 ÷ 12 = 2720) → pair (12, 2720)
- 15 divides 32640 (32640 ÷ 15 = 2176) → pair (15, 2176)
- 16 divides 32640 (32640 ÷ 16 = 2040) → pair (16, 2040)
- 17 divides 32640 (32640 ÷ 17 = 1920) → pair (17, 1920)
- 20 divides 32640 (32640 ÷ 20 = 1632) → pair (20, 1632)
- 24 divides 32640 (32640 ÷ 24 = 1360) → pair (24, 1360)
- 30 divides 32640 (32640 ÷ 30 = 1088) → pair (30, 1088)
- 32 divides 32640 (32640 ÷ 32 = 1020) → pair (32, 1020)
- 34 divides 32640 (32640 ÷ 34 = 960) → pair (34, 960)
- 40 divides 32640 (32640 ÷ 40 = 816) → pair (40, 816)
- 48 divides 32640 (32640 ÷ 48 = 680) → pair (48, 680)
- 51 divides 32640 (32640 ÷ 51 = 640) → pair (51, 640)
- 60 divides 32640 (32640 ÷ 60 = 544) → pair (60, 544)
- 64 divides 32640 (32640 ÷ 64 = 510) → pair (64, 510)
- 68 divides 32640 (32640 ÷ 68 = 480) → pair (68, 480)
- 80 divides 32640 (32640 ÷ 80 = 408) → pair (80, 408)
- 85 divides 32640 (32640 ÷ 85 = 384) → pair (85, 384)
- 96 divides 32640 (32640 ÷ 96 = 340) → pair (96, 340)
- 102 divides 32640 (32640 ÷ 102 = 320) → pair (102, 320)
- 120 divides 32640 (32640 ÷ 120 = 272) → pair (120, 272)
- 128 divides 32640 (32640 ÷ 128 = 255) → pair (128, 255)
- 136 divides 32640 (32640 ÷ 136 = 240) → pair (136, 240)
- 160 divides 32640 (32640 ÷ 160 = 204) → pair (160, 204)
- 170 divides 32640 (32640 ÷ 170 = 192) → pair (170, 192)
- Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 32, 34, 40, 48, 51, 60, 64, 68, 80, 85, 96, 102, 120, 128, 136, 160, 170, 192, 204, 240, 255, 272, 320, 340, 384, 408, 480, 510, 544, 640, 680, 816, 960, 1020, 1088, 1360, 1632, 1920, 2040, 2176, 2720, 3264, 4080, 5440, 6528, 8160, 10880, 16320, 32640} — total 64 divisors.
- Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 17 + 20 + 24 + 30 + 32 + 34 + 40 + 48 + 51 + 60 + 64 + 68 + 80 + 85 + 96 + 102 + 120 + 128 + 136 + 160 + 170 + 192 + 204 + 240 + 255 + 272 + 320 + 340 + 384 + 408 + 480 + 510 + 544 + 640 + 680 + 816 + 960 + 1020 + 1088 + 1360 + 1632 + 1920 + 2040 + 2176 + 2720 + 3264 + 4080 + 5440 + 6528 + 8160 + 10880 + 16320 + 32640 = 110160.
Nearby Examples
Related Operations for 32640
- Multiples of a Number — "outward" complement of divisors
- 32640 Prime Factorization — decompose into prime building blocks
- Find GCF of 32640 and another number
- Find LCM of 32640 and another number
- Is 32640 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