The number 81032
81032 is a composite number with 16 divisors. Its prime factorisation is × 7 × 1447. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 1447, 2894, 5788, 10129, 11576, 20258, 40516, 81032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81032: a Harshad number: divisible by its digit sum 14.
- 2
81032 is composite. Its prime factorisation is
- 3
The divisors add up to 173760; without 81032 itself that is 92728, so 81032 is abundant (92728 is more than 81032). Euler's totient φ(81032) = 34704 numbers up to 81032 share no factor with it.
- 4
The digits of 81032 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81032 = 2^{3} \times 7 \times 1447 \]81032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 173760 |
| Euler totient φ(n) | 34704 |
| Square | 6566185024 |
| Cube | 532071104864768 |
| Square root | 284.661202 (= 2√20258) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.1032 × |
81032 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand and thirty-two |
| Binary (base 2) | 10011110010001000 |
| Octal (base 8) | 236210 |
| Hexadecimal (base 16) | 13C88 |
| Base 3 | 11010011012 |
| As time | 81032 seconds = 22 h 30 min 32 s |
Is 81032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81032 ÷ 2 = 40516) | 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 (81032 ÷ 4 = 20258) | 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 | Yes (81032 ÷ 7 = 11576) | 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 (81032 ÷ 8 = 10129) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 6) | 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 81032 a prime number?
No. 81032 = × 7 × 1447, so it is divisible by 2.
What are the factors of 81032?
1, 2, 4, 7, 8, 14, 28, 56, 1447, 2894, 5788, 10129, 11576, 20258, 40516, 81032.
What is 81032 in binary?
10011110010001000 (hexadecimal 13C88, octal 236210).
What is the square root of 81032?
About 284.6612, exactly 2√20258.
Is 81032 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 81032?
81032 is a Harshad number: divisible by its digit sum 14.