The number 10160
10160 is a composite number with 20 divisors. Its prime factorisation is × 5 × 127. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 127, 254, 508, 635, 1016, 1270 … 10160.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10160: a Harshad number: divisible by its digit sum 8.
- 2
10160 is composite. Its prime factorisation is
- 3
The divisors add up to 23808; without 10160 itself that is 13648, so 10160 is abundant (13648 is more than 10160). Euler's totient φ(10160) = 4032 numbers up to 10160 share no factor with it.
- 4
The digits of 10160 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10160 = 2^{4} \times 5 \times 127 \]10160 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 23808 |
| Euler totient φ(n) | 4032 |
| Square | 103225600 |
| Cube | 1048772096000 |
| Square root | 100.796825 (= 4√635) |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 34 |
| Scientific notation | 1.016 × |
10160 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and sixty |
| Binary (base 2) | 10011110110000 |
| Octal (base 8) | 23660 |
| Hexadecimal (base 16) | 27B0 |
| Base 3 | 111221022 |
| As time | 10160 seconds = 2 h 49 min 20 s |
Is 10160 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10160 ÷ 2 = 5080) | 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 | Yes (10160 ÷ 4 = 2540) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10160 ÷ 5 = 2032) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | Yes (10160 ÷ 8 = 1270) | 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 | Yes (10160 ÷ 10 = 1016) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10160 a prime number?
No. 10160 = × 5 × 127, so it is divisible by 2.
What are the factors of 10160?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 127, 254, 508, 635, 1016, 1270, 2032, 2540, 5080, 10160.
What is 10160 in binary?
10011110110000 (hexadecimal 27B0, octal 23660).
What is the square root of 10160?
About 100.7968, exactly 4√635.
Is 10160 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 10160?
10160 is a Harshad number: divisible by its digit sum 8.