The number 90563
90563 is a composite number with 4 divisors. Its prime factorisation is 11 × 8233. Divisors (4): 1, 11, 8233, 90563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90563: a semiprime: 11 × 8233, the product of two primes.
- 2
90563 is composite. Its prime factorisation is
- 3
The divisors add up to 98808; without 90563 itself that is 8245, so 90563 is deficient (8245 is less than 90563). Euler's totient φ(90563) = 82320 numbers up to 90563 share no factor with it.
- 4
The digits of 90563 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 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90563 = 11 \times 8233 \]
90563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 98808 |
| Euler totient φ(n) | 82320 |
| Square | 8201656969 |
| Cube | 742766660083547 |
| Square root | 300.936870 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 102 |
| Scientific notation | 9.0563 × |
90563 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and sixty-three |
| Binary (base 2) | 10110000111000011 |
| Octal (base 8) | 260703 |
| Hexadecimal (base 16) | 161C3 |
| Base 3 | 11121020012 |
| As time | 90563 seconds = 25 h 9 min 23 s |
Is 90563 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 5) | 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 | Yes (90563 ÷ 11 = 8233) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90563 a prime number?
No. 90563 = 11 × 8233, so it is divisible by 11.
What are the factors of 90563?
1, 11, 8233, 90563.
What is 90563 in binary?
10110000111000011 (hexadecimal 161C3, octal 260703).
What is the square root of 90563?
About 300.9369.
Is 90563 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 90563?
90563 is a semiprime: 11 × 8233, the product of two primes.