The number 10153
10153 is a triangular number: 1 + 2 + … + 142 = 10153. Its prime factorisation is 11 × 13 × 71. Divisors (8): 1, 11, 13, 71, 143, 781, 923, 10153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10153: a triangular number: 1 + 2 + … + 142 = 10153.
- 2
10153 is composite. Its prime factorisation is
- 3
The divisors add up to 12096; without 10153 itself that is 1943, so 10153 is deficient (1943 is less than 10153). Euler's totient φ(10153) = 8400 numbers up to 10153 share no factor with it.
- 4
The digits of 10153 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10153 = 11 \times 13 \times 71 \]
10153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 12096 |
| Euler totient φ(n) | 8400 |
| Square | 103083409 |
| Cube | 1046605851577 |
| Square root | 100.762096 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.0153 × |
10153 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and fifty-three |
| Binary (base 2) | 10011110101001 |
| Octal (base 8) | 23651 |
| Hexadecimal (base 16) | 27A9 |
| Base 3 | 111221001 |
| As time | 10153 seconds = 2 h 49 min 13 s |
Is 10153 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 1) | 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 1) | 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 1) | 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 | Yes (10153 ÷ 11 = 923) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10153 a prime number?
No. 10153 = 11 × 13 × 71, so it is divisible by 11.
What are the factors of 10153?
1, 11, 13, 71, 143, 781, 923, 10153.
What is 10153 in binary?
10011110101001 (hexadecimal 27A9, octal 23651).
What is the square root of 10153?
About 100.7621.
Is 10153 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 10153?
10153 is a triangular number: 1 + 2 + … + 142 = 10153.