The number 90492
90492 is a composite number with 12 divisors. Its prime factorisation is × 3 × 7541. Divisors (12): 1, 2, 3, 4, 6, 12, 7541, 15082, 22623, 30164, 45246, 90492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90492 is composite. Its prime factorisation is
- 3
The divisors add up to 211176; without 90492 itself that is 120684, so 90492 is abundant (120684 is more than 90492). Euler's totient φ(90492) = 30160 numbers up to 90492 share no factor with it.
- 4
The digits of 90492 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90492 = 2^{2} \times 3 \times 7541 \]90492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 211176 |
| Euler totient φ(n) | 30160 |
| Square | 8188802064 |
| Cube | 741021076375488 |
| Square root | 300.818882 (= 2√22623) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0492 × |
90492 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and ninety-two |
| Binary (base 2) | 10110000101111100 |
| Octal (base 8) | 260574 |
| Hexadecimal (base 16) | 1617C |
| Base 3 | 11121010120 |
| As time | 90492 seconds = 25 h 8 min 12 s |
Is 90492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90492 ÷ 2 = 45246) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (90492 ÷ 3 = 30164) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (90492 ÷ 4 = 22623) | 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 (90492 ÷ 6 = 15082) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (90492 ÷ 12 = 7541) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90492 a prime number?
No. 90492 = × 3 × 7541, so it is divisible by 2.
What are the factors of 90492?
1, 2, 3, 4, 6, 12, 7541, 15082, 22623, 30164, 45246, 90492.
What is 90492 in binary?
10110000101111100 (hexadecimal 1617C, octal 260574).
What is the square root of 90492?
About 300.8189, exactly 2√22623.
Is 90492 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 90492?
It is a composite number with 12 divisors.