The number 90482
90482 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 23 × 281. Divisors (16): 1, 2, 7, 14, 23, 46, 161, 281, 322, 562, 1967, 3934, 6463, 12926, 45241, 90482.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90482: a Harshad number: divisible by its digit sum 23.
- 2
90482 is composite. Its prime factorisation is
- 3
The divisors add up to 162432; without 90482 itself that is 71950, so 90482 is deficient (71950 is less than 90482). Euler's totient φ(90482) = 36960 numbers up to 90482 share no factor with it.
- 4
The digits of 90482 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90482 = 2 \times 7 \times 23 \times 281 \]
90482 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 162432 |
| Euler totient φ(n) | 36960 |
| Square | 8186992324 |
| Cube | 740775439460168 |
| Square root | 300.802261 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0482 × |
90482 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and eighty-two |
| Binary (base 2) | 10110000101110010 |
| Octal (base 8) | 260562 |
| Hexadecimal (base 16) | 16172 |
| Base 3 | 11121010012 |
| As time | 90482 seconds = 25 h 8 min 2 s |
Is 90482 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90482 ÷ 2 = 45241) | 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 | No (remainder 2) | 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 (90482 ÷ 7 = 12926) | 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 2) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90482 a prime number?
No. 90482 = 2 × 7 × 23 × 281, so it is divisible by 2.
What are the factors of 90482?
1, 2, 7, 14, 23, 46, 161, 281, 322, 562, 1967, 3934, 6463, 12926, 45241, 90482.
What is 90482 in binary?
10110000101110010 (hexadecimal 16172, octal 260562).
What is the square root of 90482?
About 300.8023.
Is 90482 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 90482?
90482 is a Harshad number: divisible by its digit sum 23.