The number 81632
81632 is a composite number with 12 divisors. Its prime factorisation is × 2551. Divisors (12): 1, 2, 4, 8, 16, 32, 2551, 5102, 10204, 20408, 40816, 81632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81632 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81632 is composite. Its prime factorisation is
- 3
The divisors add up to 160776; without 81632 itself that is 79144, so 81632 is deficient (79144 is less than 81632). Euler's totient φ(81632) = 40800 numbers up to 81632 share no factor with it.
- 4
The digits of 81632 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81632 = 2^{5} \times 2551 \]81632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 160776 |
| Euler totient φ(n) | 40800 |
| Square | 6663783424 |
| Cube | 543977968467968 |
| Square root | 285.713143 (= 4√5102) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.1632 × |
81632 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand six hundred and thirty-two |
| Binary (base 2) | 10011111011100000 |
| Octal (base 8) | 237340 |
| Hexadecimal (base 16) | 13EE0 |
| Base 3 | 11010222102 |
| As time | 81632 seconds = 22 h 40 min 32 s |
Is 81632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81632 ÷ 2 = 40816) | 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 (81632 ÷ 4 = 20408) | 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 5) | 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 (81632 ÷ 8 = 10204) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 1) | 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 81632 a prime number?
No. 81632 = × 2551, so it is divisible by 2.
What are the factors of 81632?
1, 2, 4, 8, 16, 32, 2551, 5102, 10204, 20408, 40816, 81632.
What is 81632 in binary?
10011111011100000 (hexadecimal 13EE0, octal 237340).
What is the square root of 81632?
About 285.7131, exactly 4√5102.
Is 81632 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 81632?
It is a composite number with 12 divisors.