The number 17153
17153 is a composite number with 4 divisors. Its prime factorisation is 17 × 1009. Divisors (4): 1, 17, 1009, 17153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 17153: a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 1009, the product of two primes.
- 2
17153 is composite. Its prime factorisation is
- 3
The divisors add up to 18180; without 17153 itself that is 1027, so 17153 is deficient (1027 is less than 17153). Euler's totient φ(17153) = 16128 numbers up to 17153 share no factor with it.
- 4
The digits of 17153 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 17153 = 17 \times 1009 \]
17153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18180 |
| Euler totient φ(n) | 16128 |
| Square | 294225409 |
| Cube | 5046848440577 |
| Square root | 130.969462 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 66 |
| Scientific notation | 1.7153 × |
17153 in other forms
| Form | Value |
|---|---|
| In words | seventeen thousand one hundred and fifty-three |
| Binary (base 2) | 100001100000001 |
| Octal (base 8) | 41401 |
| Hexadecimal (base 16) | 4301 |
| Base 3 | 212112022 |
| As time | 17153 seconds = 4 h 45 min 53 s |
Is 17153 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 17153 a prime number?
No. 17153 = 17 × 1009, so it is divisible by 17.
What are the factors of 17153?
1, 17, 1009, 17153.
What is 17153 in binary?
100001100000001 (hexadecimal 4301, octal 41401).
What is the square root of 17153?
About 130.9695.
Is 17153 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 17153?
17153 is a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 1009, the product of two primes.