The number 90483
90483 is a composite number with 4 divisors. Its prime factorisation is 3 × 30161. Divisors (4): 1, 3, 30161, 90483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90483: a semiprime: 3 × 30161, the product of two primes.
- 2
90483 is composite. Its prime factorisation is
- 3
The divisors add up to 120648; without 90483 itself that is 30165, so 90483 is deficient (30165 is less than 90483). Euler's totient φ(90483) = 60320 numbers up to 90483 share no factor with it.
- 4
The digits of 90483 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 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90483 = 3 \times 30161 \]
90483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 120648 |
| Euler totient φ(n) | 60320 |
| Square | 8187173289 |
| Cube | 740800000708587 |
| Square root | 300.803923 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0483 × |
90483 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and eighty-three |
| Binary (base 2) | 10110000101110011 |
| Octal (base 8) | 260563 |
| Hexadecimal (base 16) | 16173 |
| Base 3 | 11121010020 |
| As time | 90483 seconds = 25 h 8 min 3 s |
Is 90483 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (90483 ÷ 3 = 30161) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90483 a prime number?
No. 90483 = 3 × 30161, so it is divisible by 3.
What are the factors of 90483?
1, 3, 30161, 90483.
What is 90483 in binary?
10110000101110011 (hexadecimal 16173, octal 260563).
What is the square root of 90483?
About 300.8039.
Is 90483 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 90483?
90483 is a semiprime: 3 × 30161, the product of two primes.