The number 81153
81153 is a composite number with 12 divisors. Its prime factorisation is × 71 × 127. Divisors (12): 1, 3, 9, 71, 127, 213, 381, 639, 1143, 9017, 27051, 81153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81153: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
81153 is composite. Its prime factorisation is
- 3
The divisors add up to 119808; without 81153 itself that is 38655, so 81153 is deficient (38655 is less than 81153). Euler's totient φ(81153) = 52920 numbers up to 81153 share no factor with it.
- 4
The digits of 81153 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81153 = 3^{2} \times 71 \times 127 \]81153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 119808 |
| Euler totient φ(n) | 52920 |
| Square | 6585809409 |
| Cube | 534458190968577 |
| Square root | 284.873656 (= 3√9017) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.1153 × |
81153 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand one hundred and fifty-three |
| Binary (base 2) | 10011110100000001 |
| Octal (base 8) | 236401 |
| Hexadecimal (base 16) | 13D01 |
| Base 3 | 11010022200 |
| As time | 81153 seconds = 22 h 32 min 33 s |
Is 81153 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 | Yes (81153 ÷ 3 = 27051) | 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 3) | 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 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (81153 ÷ 9 = 9017) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81153 a prime number?
No. 81153 = × 71 × 127, so it is divisible by 3.
What are the factors of 81153?
1, 3, 9, 71, 127, 213, 381, 639, 1143, 9017, 27051, 81153.
What is 81153 in binary?
10011110100000001 (hexadecimal 13D01, octal 236401).
What is the square root of 81153?
About 284.8737, exactly 3√9017.
Is 81153 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 81153?
81153 is a happy number: repeatedly adding the squares of its digits reaches 1.