The number 90330
90330 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 3011. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 3011, 6022, 9033, 15055, 18066, 30110, 45165, 90330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90330: a Harshad number: divisible by its digit sum 15.
- 2
90330 is composite. Its prime factorisation is
- 3
The divisors add up to 216864; without 90330 itself that is 126534, so 90330 is abundant (126534 is more than 90330). Euler's totient φ(90330) = 24080 numbers up to 90330 share no factor with it.
- 4
The digits of 90330 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90330 = 2 \times 3 \times 5 \times 3011 \]
90330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 216864 |
| Euler totient φ(n) | 24080 |
| Square | 8159508900 |
| Cube | 737048438937000 |
| Square root | 300.549497 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 151 |
| Scientific notation | 9.033 × |
90330 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand three hundred and thirty |
| Binary (base 2) | 10110000011011010 |
| Octal (base 8) | 260332 |
| Hexadecimal (base 16) | 160DA |
| Base 3 | 11120220120 |
| As time | 90330 seconds = 25 h 5 min 30 s |
Is 90330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90330 ÷ 2 = 45165) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (90330 ÷ 3 = 30110) | 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 | Yes (90330 ÷ 5 = 18066) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (90330 ÷ 6 = 15055) | 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 | No (remainder 2) | 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 | Yes (90330 ÷ 10 = 9033) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90330 a prime number?
No. 90330 = 2 × 3 × 5 × 3011, so it is divisible by 2.
What are the factors of 90330?
1, 2, 3, 5, 6, 10, 15, 30, 3011, 6022, 9033, 15055, 18066, 30110, 45165, 90330.
What is 90330 in binary?
10110000011011010 (hexadecimal 160DA, octal 260332).
What is the square root of 90330?
About 300.5495.
Is 90330 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 90330?
90330 is a Harshad number: divisible by its digit sum 15.