The number 10170
10170 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 113. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 113, 226, 339, 565 … 10170.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10170: a Harshad number: divisible by its digit sum 9.
- 2
10170 is composite. Its prime factorisation is
- 3
The divisors add up to 26676; without 10170 itself that is 16506, so 10170 is abundant (16506 is more than 10170). Euler's totient φ(10170) = 2688 numbers up to 10170 share no factor with it.
- 4
The digits of 10170 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10170 = 2 \times 3^{2} \times 5 \times 113 \]10170 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 26676 |
| Euler totient φ(n) | 2688 |
| Square | 103428900 |
| Cube | 1051871913000 |
| Square root | 100.846418 (= 3√1130) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 34 |
| Scientific notation | 1.017 × |
10170 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and seventy |
| Binary (base 2) | 10011110111010 |
| Octal (base 8) | 23672 |
| Hexadecimal (base 16) | 27BA |
| Base 3 | 111221200 |
| As time | 10170 seconds = 2 h 49 min 30 s |
Is 10170 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10170 ÷ 2 = 5085) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10170 ÷ 3 = 3390) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10170 ÷ 5 = 2034) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (10170 ÷ 6 = 1695) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (10170 ÷ 9 = 1130) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10170 ÷ 10 = 1017) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10170 a prime number?
No. 10170 = 2 × × 5 × 113, so it is divisible by 2.
What are the factors of 10170?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 113, 226, 339, 565, 678, 1017, 1130, 1695, 2034, 3390, 5085, 10170.
What is 10170 in binary?
10011110111010 (hexadecimal 27BA, octal 23672).
What is the square root of 10170?
About 100.8464, exactly 3√1130.
Is 10170 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 10170?
10170 is a Harshad number: divisible by its digit sum 9.