The number 90693
90693 is a composite number with 8 divisors. Its prime factorisation is × 3359. Divisors (8): 1, 3, 9, 27, 3359, 10077, 30231, 90693.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90693: a Harshad number: divisible by its digit sum 27.
- 2
90693 is composite. Its prime factorisation is
- 3
The divisors add up to 134400; without 90693 itself that is 43707, so 90693 is deficient (43707 is less than 90693). Euler's totient φ(90693) = 60444 numbers up to 90693 share no factor with it.
- 4
The digits of 90693 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90693 = 3^{3} \times 3359 \]90693 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 134400 |
| Euler totient φ(n) | 60444 |
| Square | 8225220249 |
| Cube | 745969900042557 |
| Square root | 301.152785 (= 3√10077) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0693 × |
90693 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand six hundred and ninety-three |
| Binary (base 2) | 10110001001000101 |
| Octal (base 8) | 261105 |
| Hexadecimal (base 16) | 16245 |
| Base 3 | 11121102000 |
| As time | 90693 seconds = 25 h 11 min 33 s |
Is 90693 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 (90693 ÷ 3 = 30231) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (90693 ÷ 9 = 10077) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90693 a prime number?
No. 90693 = × 3359, so it is divisible by 3.
What are the factors of 90693?
1, 3, 9, 27, 3359, 10077, 30231, 90693.
What is 90693 in binary?
10110001001000101 (hexadecimal 16245, octal 261105).
What is the square root of 90693?
About 301.1528, exactly 3√10077.
Is 90693 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 90693?
90693 is a Harshad number: divisible by its digit sum 27.