The number 81152
81152 is a composite number with 18 divisors. Its prime factorisation is × 317. Divisors (18): 1, 2, 4, 8, 16, 32, 64, 128, 256, 317, 634, 1268, 2536, 5072, 10144, 20288 … 81152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81152 is composite. Its prime factorisation is
- 3
The divisors add up to 162498; without 81152 itself that is 81346, so 81152 is abundant (81346 is more than 81152). Euler's totient φ(81152) = 40448 numbers up to 81152 share no factor with it.
- 4
The digits of 81152 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81152 = 2^{8} \times 317 \]81152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 162498 |
| Euler totient φ(n) | 40448 |
| Square | 6585647104 |
| Cube | 534438433783808 |
| Square root | 284.871901 (= 16√317) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 45 |
| Scientific notation | 8.1152 × |
81152 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand one hundred and fifty-two |
| Binary (base 2) | 10011110100000000 |
| Octal (base 8) | 236400 |
| Hexadecimal (base 16) | 13D00 |
| Base 3 | 11010022122 |
| As time | 81152 seconds = 22 h 32 min 32 s |
Is 81152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81152 ÷ 2 = 40576) | 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 (81152 ÷ 4 = 20288) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (81152 ÷ 8 = 10144) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 81152 a prime number?
No. 81152 = × 317, so it is divisible by 2.
What are the factors of 81152?
1, 2, 4, 8, 16, 32, 64, 128, 256, 317, 634, 1268, 2536, 5072, 10144, 20288, 40576, 81152.
What is 81152 in binary?
10011110100000000 (hexadecimal 13D00, octal 236400).
What is the square root of 81152?
About 284.8719, exactly 16√317.
Is 81152 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 81152?
It is a composite number with 18 divisors.