Divisors of 19656: All 64 Factors
Quick Answer
19656 has 64 divisors (factors): 1, 2, 3, 4, 6, 7, 8, 9, 12, 13, 14, 18, 21, 24, 26, 27, 28, 36, 39, 42, 52, 54, 56, 63, 72, 78, 84, 91, 104, 108, 117, 126, 156, 168, 182, 189, 216, 234, 252, 273, 312, 351, 364, 378, 468, 504, 546, 702, 728, 756, 819, 936, 1092, 1404, 1512, 1638, 2184, 2457, 2808, 3276, 4914, 6552, 9828, 19656.
Sum: 67200.
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 19656
The number 19656 has 64 divisors:
1, 2, 3, 4, 6, 7, 8, 9, 12, 13, 14, 18, 21, 24, 26, 27, 28, 36, 39, 42, 52, 54, 56, 63, 72, 78, 84, 91, 104, 108, 117, 126, 156, 168, 182, 189, 216, 234, 252, 273, 312, 351, 364, 378, 468, 504, 546, 702, 728, 756, 819, 936, 1092, 1404, 1512, 1638, 2184, 2457, 2808, 3276, 4914, 6552, 9828, 19656
Divisor Pairs of 19656
Each pair multiplies to 19656:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 19656 | = | 19656 |
| 2 | × | 9828 | = | 19656 |
| 3 | × | 6552 | = | 19656 |
| 4 | × | 4914 | = | 19656 |
| 6 | × | 3276 | = | 19656 |
| 7 | × | 2808 | = | 19656 |
| 8 | × | 2457 | = | 19656 |
| 9 | × | 2184 | = | 19656 |
| 12 | × | 1638 | = | 19656 |
| 13 | × | 1512 | = | 19656 |
| 14 | × | 1404 | = | 19656 |
| 18 | × | 1092 | = | 19656 |
| 21 | × | 936 | = | 19656 |
| 24 | × | 819 | = | 19656 |
| 26 | × | 756 | = | 19656 |
| 27 | × | 728 | = | 19656 |
| 28 | × | 702 | = | 19656 |
| 36 | × | 546 | = | 19656 |
| 39 | × | 504 | = | 19656 |
| 42 | × | 468 | = | 19656 |
| 52 | × | 378 | = | 19656 |
| 54 | × | 364 | = | 19656 |
| 56 | × | 351 | = | 19656 |
| 63 | × | 312 | = | 19656 |
| 72 | × | 273 | = | 19656 |
| 78 | × | 252 | = | 19656 |
| 84 | × | 234 | = | 19656 |
| 91 | × | 216 | = | 19656 |
| 104 | × | 189 | = | 19656 |
| 108 | × | 182 | = | 19656 |
| 117 | × | 168 | = | 19656 |
| 126 | × | 156 | = | 19656 |
Number of Divisors
The number 19656 has 64 divisors, written as τ(19656) = 64 in number theory.
Sum of Divisors
σ(19656) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 9 + 12 + 13 + 14 + 18 + 21 + 24 + 26 + 27 + 28 + 36 + 39 + 42 + 52 + 54 + 56 + 63 + 72 + 78 + 84 + 91 + 104 + 108 + 117 + 126 + 156 + 168 + 182 + 189 + 216 + 234 + 252 + 273 + 312 + 351 + 364 + 378 + 468 + 504 + 546 + 702 + 728 + 756 + 819 + 936 + 1092 + 1404 + 1512 + 1638 + 2184 + 2457 + 2808 + 3276 + 4914 + 6552 + 9828 + 19656 = 67200
Prime Factorization of 19656
Properties of 19656
- 19656 is composite.
- 19656 is not a perfect square.
- Number of divisors: 64.
- Sum of divisors: 67200.
Common Divisors with Another Number?
Looking for the divisors that 19656 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 19656
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √19656 ≈ 140.20. If i divides 19656, then both i and 19656/i are divisors.
- 1 divides 19656 (19656 ÷ 1 = 19656) → pair (1, 19656)
- 2 divides 19656 (19656 ÷ 2 = 9828) → pair (2, 9828)
- 3 divides 19656 (19656 ÷ 3 = 6552) → pair (3, 6552)
- 4 divides 19656 (19656 ÷ 4 = 4914) → pair (4, 4914)
- 6 divides 19656 (19656 ÷ 6 = 3276) → pair (6, 3276)
- 7 divides 19656 (19656 ÷ 7 = 2808) → pair (7, 2808)
- 8 divides 19656 (19656 ÷ 8 = 2457) → pair (8, 2457)
- 9 divides 19656 (19656 ÷ 9 = 2184) → pair (9, 2184)
- 12 divides 19656 (19656 ÷ 12 = 1638) → pair (12, 1638)
- 13 divides 19656 (19656 ÷ 13 = 1512) → pair (13, 1512)
- 14 divides 19656 (19656 ÷ 14 = 1404) → pair (14, 1404)
- 18 divides 19656 (19656 ÷ 18 = 1092) → pair (18, 1092)
- 21 divides 19656 (19656 ÷ 21 = 936) → pair (21, 936)
- 24 divides 19656 (19656 ÷ 24 = 819) → pair (24, 819)
- 26 divides 19656 (19656 ÷ 26 = 756) → pair (26, 756)
- 27 divides 19656 (19656 ÷ 27 = 728) → pair (27, 728)
- 28 divides 19656 (19656 ÷ 28 = 702) → pair (28, 702)
- 36 divides 19656 (19656 ÷ 36 = 546) → pair (36, 546)
- 39 divides 19656 (19656 ÷ 39 = 504) → pair (39, 504)
- 42 divides 19656 (19656 ÷ 42 = 468) → pair (42, 468)
- 52 divides 19656 (19656 ÷ 52 = 378) → pair (52, 378)
- 54 divides 19656 (19656 ÷ 54 = 364) → pair (54, 364)
- 56 divides 19656 (19656 ÷ 56 = 351) → pair (56, 351)
- 63 divides 19656 (19656 ÷ 63 = 312) → pair (63, 312)
- 72 divides 19656 (19656 ÷ 72 = 273) → pair (72, 273)
- 78 divides 19656 (19656 ÷ 78 = 252) → pair (78, 252)
- 84 divides 19656 (19656 ÷ 84 = 234) → pair (84, 234)
- 91 divides 19656 (19656 ÷ 91 = 216) → pair (91, 216)
- 104 divides 19656 (19656 ÷ 104 = 189) → pair (104, 189)
- 108 divides 19656 (19656 ÷ 108 = 182) → pair (108, 182)
- 117 divides 19656 (19656 ÷ 117 = 168) → pair (117, 168)
- 126 divides 19656 (19656 ÷ 126 = 156) → pair (126, 156)
- Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 9, 12, 13, 14, 18, 21, 24, 26, 27, 28, 36, 39, 42, 52, 54, 56, 63, 72, 78, 84, 91, 104, 108, 117, 126, 156, 168, 182, 189, 216, 234, 252, 273, 312, 351, 364, 378, 468, 504, 546, 702, 728, 756, 819, 936, 1092, 1404, 1512, 1638, 2184, 2457, 2808, 3276, 4914, 6552, 9828, 19656} — total 64 divisors.
- Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 9 + 12 + 13 + 14 + 18 + 21 + 24 + 26 + 27 + 28 + 36 + 39 + 42 + 52 + 54 + 56 + 63 + 72 + 78 + 84 + 91 + 104 + 108 + 117 + 126 + 156 + 168 + 182 + 189 + 216 + 234 + 252 + 273 + 312 + 351 + 364 + 378 + 468 + 504 + 546 + 702 + 728 + 756 + 819 + 936 + 1092 + 1404 + 1512 + 1638 + 2184 + 2457 + 2808 + 3276 + 4914 + 6552 + 9828 + 19656 = 67200.
Nearby Examples
Related Operations for 19656
- Multiples of a Number — "outward" complement of divisors
- 19656 Prime Factorization — decompose into prime building blocks
- Find GCF of 19656 and another number
- Find LCM of 19656 and another number
- Is 19656 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