The number 17152
17152 is a composite number with 18 divisors. Its prime factorisation is × 67. Divisors (18): 1, 2, 4, 8, 16, 32, 64, 67, 128, 134, 256, 268, 536, 1072, 2144, 4288 … 17152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 17152: a Harshad number: divisible by its digit sum 16.
- 2
17152 is composite. Its prime factorisation is
- 3
The divisors add up to 34748; without 17152 itself that is 17596, so 17152 is abundant (17596 is more than 17152). Euler's totient φ(17152) = 8448 numbers up to 17152 share no factor with it.
- 4
The digits of 17152 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 35 steps to reach 1.
LaTeX source of the formulas on this page
\[ 17152 = 2^{8} \times 67 \]17152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 34748 |
| Euler totient φ(n) | 8448 |
| Square | 294191104 |
| Cube | 5045965815808 |
| Square root | 130.965644 (= 16√67) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 35 |
| Scientific notation | 1.7152 × |
17152 in other forms
| Form | Value |
|---|---|
| In words | seventeen thousand one hundred and fifty-two |
| Binary (base 2) | 100001100000000 |
| Octal (base 8) | 41400 |
| Hexadecimal (base 16) | 4300 |
| Base 3 | 212112021 |
| As time | 17152 seconds = 4 h 45 min 52 s |
Is 17152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (17152 ÷ 2 = 8576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (17152 ÷ 4 = 4288) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (17152 ÷ 8 = 2144) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 17152 a prime number?
No. 17152 = × 67, so it is divisible by 2.
What are the factors of 17152?
1, 2, 4, 8, 16, 32, 64, 67, 128, 134, 256, 268, 536, 1072, 2144, 4288, 8576, 17152.
What is 17152 in binary?
100001100000000 (hexadecimal 4300, octal 41400).
What is the square root of 17152?
About 130.9656, exactly 16√67.
Is 17152 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 17152?
17152 is a Harshad number: divisible by its digit sum 16.