The number 9366
9366 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 7 × 223. Divisors (16): 1, 2, 3, 6, 7, 14, 21, 42, 223, 446, 669, 1338, 1561, 3122, 4683, 9366.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9366 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9366 is composite. Its prime factorisation is
- 3
The divisors add up to 21504; without 9366 itself that is 12138, so 9366 is abundant (12138 is more than 9366). Euler's totient φ(9366) = 2664 numbers up to 9366 share no factor with it.
- 4
The digits of 9366 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9366 = 2 \times 3 \times 7 \times 223 \]
9366 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 21504 |
| Euler totient φ(n) | 2664 |
| Square | 87721956 |
| Cube | 821603839896 |
| Square root | 96.778097 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.366 × |
9366 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and sixty-six |
| Binary (base 2) | 10010010010110 |
| Octal (base 8) | 22226 |
| Hexadecimal (base 16) | 2496 |
| Base 3 | 110211220 |
| As time | 9366 seconds = 2 h 36 min 6 s |
Is 9366 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9366 ÷ 2 = 4683) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9366 ÷ 3 = 3122) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (9366 ÷ 6 = 1561) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (9366 ÷ 7 = 1338) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9366 a prime number?
No. 9366 = 2 × 3 × 7 × 223, so it is divisible by 2.
What are the factors of 9366?
1, 2, 3, 6, 7, 14, 21, 42, 223, 446, 669, 1338, 1561, 3122, 4683, 9366.
What is 9366 in binary?
10010010010110 (hexadecimal 2496, octal 22226).
What is the square root of 9366?
About 96.7781.
Is 9366 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 9366?
It is a composite number with 16 divisors.