The number 90963
90963 is a composite number with 10 divisors. Its prime factorisation is × 1123. Divisors (10): 1, 3, 9, 27, 81, 1123, 3369, 10107, 30321, 90963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90963: a Harshad number: divisible by its digit sum 27.
- 2
90963 is composite. Its prime factorisation is
- 3
The divisors add up to 136004; without 90963 itself that is 45041, so 90963 is deficient (45041 is less than 90963). Euler's totient φ(90963) = 60588 numbers up to 90963 share no factor with it.
- 4
The digits of 90963 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90963 = 3^{4} \times 1123 \]90963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 136004 |
| Euler totient φ(n) | 60588 |
| Square | 8274267369 |
| Cube | 752652182686347 |
| Square root | 301.600729 (= 9√1123) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.0963 × |
90963 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand nine hundred and sixty-three |
| Binary (base 2) | 10110001101010011 |
| Octal (base 8) | 261523 |
| Hexadecimal (base 16) | 16353 |
| Base 3 | 11121210000 |
| As time | 90963 seconds = 25 h 16 min 3 s |
Is 90963 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 (90963 ÷ 3 = 30321) | 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 5) | 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 | Yes (90963 ÷ 9 = 10107) | 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 4) | 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 90963 a prime number?
No. 90963 = × 1123, so it is divisible by 3.
What are the factors of 90963?
1, 3, 9, 27, 81, 1123, 3369, 10107, 30321, 90963.
What is 90963 in binary?
10110001101010011 (hexadecimal 16353, octal 261523).
What is the square root of 90963?
About 301.6007, exactly 9√1123.
Is 90963 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 90963?
90963 is a Harshad number: divisible by its digit sum 27.