Divisors of 16170: All 48 Factors
Quick Answer
16170 has 48 divisors (factors): 1, 2, 3, 5, 6, 7, 10, 11, 14, 15, 21, 22, 30, 33, 35, 42, 49, 55, 66, 70, 77, 98, 105, 110, 147, 154, 165, 210, 231, 245, 294, 330, 385, 462, 490, 539, 735, 770, 1078, 1155, 1470, 1617, 2310, 2695, 3234, 5390, 8085, 16170.
Sum: 49248.
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 16170
The number 16170 has 48 divisors:
1, 2, 3, 5, 6, 7, 10, 11, 14, 15, 21, 22, 30, 33, 35, 42, 49, 55, 66, 70, 77, 98, 105, 110, 147, 154, 165, 210, 231, 245, 294, 330, 385, 462, 490, 539, 735, 770, 1078, 1155, 1470, 1617, 2310, 2695, 3234, 5390, 8085, 16170
Divisor Pairs of 16170
Each pair multiplies to 16170:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 16170 | = | 16170 |
| 2 | × | 8085 | = | 16170 |
| 3 | × | 5390 | = | 16170 |
| 5 | × | 3234 | = | 16170 |
| 6 | × | 2695 | = | 16170 |
| 7 | × | 2310 | = | 16170 |
| 10 | × | 1617 | = | 16170 |
| 11 | × | 1470 | = | 16170 |
| 14 | × | 1155 | = | 16170 |
| 15 | × | 1078 | = | 16170 |
| 21 | × | 770 | = | 16170 |
| 22 | × | 735 | = | 16170 |
| 30 | × | 539 | = | 16170 |
| 33 | × | 490 | = | 16170 |
| 35 | × | 462 | = | 16170 |
| 42 | × | 385 | = | 16170 |
| 49 | × | 330 | = | 16170 |
| 55 | × | 294 | = | 16170 |
| 66 | × | 245 | = | 16170 |
| 70 | × | 231 | = | 16170 |
| 77 | × | 210 | = | 16170 |
| 98 | × | 165 | = | 16170 |
| 105 | × | 154 | = | 16170 |
| 110 | × | 147 | = | 16170 |
Number of Divisors
The number 16170 has 48 divisors, written as τ(16170) = 48 in number theory.
Sum of Divisors
σ(16170) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 11 + 14 + 15 + 21 + 22 + 30 + 33 + 35 + 42 + 49 + 55 + 66 + 70 + 77 + 98 + 105 + 110 + 147 + 154 + 165 + 210 + 231 + 245 + 294 + 330 + 385 + 462 + 490 + 539 + 735 + 770 + 1078 + 1155 + 1470 + 1617 + 2310 + 2695 + 3234 + 5390 + 8085 + 16170 = 49248
Prime Factorization of 16170
Properties of 16170
- 16170 is composite.
- 16170 is not a perfect square.
- Number of divisors: 48.
- Sum of divisors: 49248.
Common Divisors with Another Number?
Looking for the divisors that 16170 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 16170
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √16170 ≈ 127.16. If i divides 16170, then both i and 16170/i are divisors.
- 1 divides 16170 (16170 ÷ 1 = 16170) → pair (1, 16170)
- 2 divides 16170 (16170 ÷ 2 = 8085) → pair (2, 8085)
- 3 divides 16170 (16170 ÷ 3 = 5390) → pair (3, 5390)
- 5 divides 16170 (16170 ÷ 5 = 3234) → pair (5, 3234)
- 6 divides 16170 (16170 ÷ 6 = 2695) → pair (6, 2695)
- 7 divides 16170 (16170 ÷ 7 = 2310) → pair (7, 2310)
- 10 divides 16170 (16170 ÷ 10 = 1617) → pair (10, 1617)
- 11 divides 16170 (16170 ÷ 11 = 1470) → pair (11, 1470)
- 14 divides 16170 (16170 ÷ 14 = 1155) → pair (14, 1155)
- 15 divides 16170 (16170 ÷ 15 = 1078) → pair (15, 1078)
- 21 divides 16170 (16170 ÷ 21 = 770) → pair (21, 770)
- 22 divides 16170 (16170 ÷ 22 = 735) → pair (22, 735)
- 30 divides 16170 (16170 ÷ 30 = 539) → pair (30, 539)
- 33 divides 16170 (16170 ÷ 33 = 490) → pair (33, 490)
- 35 divides 16170 (16170 ÷ 35 = 462) → pair (35, 462)
- 42 divides 16170 (16170 ÷ 42 = 385) → pair (42, 385)
- 49 divides 16170 (16170 ÷ 49 = 330) → pair (49, 330)
- 55 divides 16170 (16170 ÷ 55 = 294) → pair (55, 294)
- 66 divides 16170 (16170 ÷ 66 = 245) → pair (66, 245)
- 70 divides 16170 (16170 ÷ 70 = 231) → pair (70, 231)
- 77 divides 16170 (16170 ÷ 77 = 210) → pair (77, 210)
- 98 divides 16170 (16170 ÷ 98 = 165) → pair (98, 165)
- 105 divides 16170 (16170 ÷ 105 = 154) → pair (105, 154)
- 110 divides 16170 (16170 ÷ 110 = 147) → pair (110, 147)
- Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 11, 14, 15, 21, 22, 30, 33, 35, 42, 49, 55, 66, 70, 77, 98, 105, 110, 147, 154, 165, 210, 231, 245, 294, 330, 385, 462, 490, 539, 735, 770, 1078, 1155, 1470, 1617, 2310, 2695, 3234, 5390, 8085, 16170} — total 48 divisors.
- Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 11 + 14 + 15 + 21 + 22 + 30 + 33 + 35 + 42 + 49 + 55 + 66 + 70 + 77 + 98 + 105 + 110 + 147 + 154 + 165 + 210 + 231 + 245 + 294 + 330 + 385 + 462 + 490 + 539 + 735 + 770 + 1078 + 1155 + 1470 + 1617 + 2310 + 2695 + 3234 + 5390 + 8085 + 16170 = 49248.
Nearby Examples
Related Operations for 16170
- Multiples of a Number — "outward" complement of divisors
- 16170 Prime Factorization — decompose into prime building blocks
- Find GCF of 16170 and another number
- Find LCM of 16170 and another number
- Is 16170 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