The number 93663
93663 is a composite number with 8 divisors. Its prime factorisation is × 3469. Divisors (8): 1, 3, 9, 27, 3469, 10407, 31221, 93663.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93663: a Harshad number: divisible by its digit sum 27.
- 2
93663 is composite. Its prime factorisation is
- 3
The divisors add up to 138800; without 93663 itself that is 45137, so 93663 is deficient (45137 is less than 93663). Euler's totient φ(93663) = 62424 numbers up to 93663 share no factor with it.
- 4
The digits of 93663 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93663 = 3^{3} \times 3469 \]93663 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 138800 |
| Euler totient φ(n) | 62424 |
| Square | 8772757569 |
| Cube | 821682792185247 |
| Square root | 306.044114 (= 3√10407) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.3663 × |
93663 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and sixty-three |
| Binary (base 2) | 10110110111011111 |
| Octal (base 8) | 266737 |
| Hexadecimal (base 16) | 16DDF |
| Base 3 | 11202111000 |
| As time | 93663 seconds = 26 h 1 min 3 s |
Is 93663 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 (93663 ÷ 3 = 31221) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93663 ÷ 9 = 10407) | 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 93663 a prime number?
No. 93663 = × 3469, so it is divisible by 3.
What are the factors of 93663?
1, 3, 9, 27, 3469, 10407, 31221, 93663.
What is 93663 in binary?
10110110111011111 (hexadecimal 16DDF, octal 266737).
What is the square root of 93663?
About 306.0441, exactly 3√10407.
Is 93663 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 93663?
93663 is a Harshad number: divisible by its digit sum 27.