The number 81496
81496 is a composite number with 16 divisors. Its prime factorisation is × 61 × 167. Divisors (16): 1, 2, 4, 8, 61, 122, 167, 244, 334, 488, 668, 1336, 10187, 20374, 40748, 81496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81496 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81496 is composite. Its prime factorisation is
- 3
The divisors add up to 156240; without 81496 itself that is 74744, so 81496 is deficient (74744 is less than 81496). Euler's totient φ(81496) = 39840 numbers up to 81496 share no factor with it.
- 4
The digits of 81496 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81496 = 2^{3} \times 61 \times 167 \]81496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 156240 |
| Euler totient φ(n) | 39840 |
| Square | 6641598016 |
| Cube | 541263671911936 |
| Square root | 285.475043 (= 2√20374) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 37 |
| Scientific notation | 8.1496 × |
81496 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and ninety-six |
| Binary (base 2) | 10011111001011000 |
| Octal (base 8) | 237130 |
| Hexadecimal (base 16) | 13E58 |
| Base 3 | 11010210101 |
| As time | 81496 seconds = 22 h 38 min 16 s |
Is 81496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81496 ÷ 2 = 40748) | 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 | Yes (81496 ÷ 4 = 20374) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | Yes (81496 ÷ 8 = 10187) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81496 a prime number?
No. 81496 = × 61 × 167, so it is divisible by 2.
What are the factors of 81496?
1, 2, 4, 8, 61, 122, 167, 244, 334, 488, 668, 1336, 10187, 20374, 40748, 81496.
What is 81496 in binary?
10011111001011000 (hexadecimal 13E58, octal 237130).
What is the square root of 81496?
About 285.4750, exactly 2√20374.
Is 81496 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 81496?
It is a composite number with 16 divisors.