The number 90363
90363 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 13 × 331. Divisors (16): 1, 3, 7, 13, 21, 39, 91, 273, 331, 993, 2317, 4303, 6951, 12909, 30121, 90363.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90363: a Harshad number: divisible by its digit sum 21.
- 2
90363 is composite. Its prime factorisation is
- 3
The divisors add up to 148736; without 90363 itself that is 58373, so 90363 is deficient (58373 is less than 90363). Euler's totient φ(90363) = 47520 numbers up to 90363 share no factor with it.
- 4
The digits of 90363 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90363 = 3 \times 7 \times 13 \times 331 \]
90363 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 148736 |
| Euler totient φ(n) | 47520 |
| Square | 8165471769 |
| Cube | 737856525462147 |
| Square root | 300.604391 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 208 |
| Scientific notation | 9.0363 × |
90363 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand three hundred and sixty-three |
| Binary (base 2) | 10110000011111011 |
| Octal (base 8) | 260373 |
| Hexadecimal (base 16) | 160FB |
| Base 3 | 11120221210 |
| As time | 90363 seconds = 25 h 6 min 3 s |
Is 90363 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 (90363 ÷ 3 = 30121) | 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 | Yes (90363 ÷ 7 = 12909) | 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 3) | 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 9) | 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 90363 a prime number?
No. 90363 = 3 × 7 × 13 × 331, so it is divisible by 3.
What are the factors of 90363?
1, 3, 7, 13, 21, 39, 91, 273, 331, 993, 2317, 4303, 6951, 12909, 30121, 90363.
What is 90363 in binary?
10110000011111011 (hexadecimal 160FB, octal 260373).
What is the square root of 90363?
About 300.6044.
Is 90363 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 90363?
90363 is a Harshad number: divisible by its digit sum 21.