The number 81492
81492 is a composite number with 12 divisors. Its prime factorisation is × 3 × 6791. Divisors (12): 1, 2, 3, 4, 6, 12, 6791, 13582, 20373, 27164, 40746, 81492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81492 is composite. Its prime factorisation is
- 3
The divisors add up to 190176; without 81492 itself that is 108684, so 81492 is abundant (108684 is more than 81492). Euler's totient φ(81492) = 27160 numbers up to 81492 share no factor with it.
- 4
The digits of 81492 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81492 = 2^{2} \times 3 \times 6791 \]81492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 190176 |
| Euler totient φ(n) | 27160 |
| Square | 6640946064 |
| Cube | 541183976647488 |
| Square root | 285.468037 (= 2√20373) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 37 |
| Scientific notation | 8.1492 × |
81492 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and ninety-two |
| Binary (base 2) | 10011111001010100 |
| Octal (base 8) | 237124 |
| Hexadecimal (base 16) | 13E54 |
| Base 3 | 11010210020 |
| As time | 81492 seconds = 22 h 38 min 12 s |
Is 81492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81492 ÷ 2 = 40746) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (81492 ÷ 3 = 27164) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (81492 ÷ 4 = 20373) | 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 | Yes (81492 ÷ 6 = 13582) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (81492 ÷ 12 = 6791) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81492 a prime number?
No. 81492 = × 3 × 6791, so it is divisible by 2.
What are the factors of 81492?
1, 2, 3, 4, 6, 12, 6791, 13582, 20373, 27164, 40746, 81492.
What is 81492 in binary?
10011111001010100 (hexadecimal 13E54, octal 237124).
What is the square root of 81492?
About 285.4680, exactly 2√20373.
Is 81492 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 81492?
It is a composite number with 12 divisors.