The number 9368
9368 is a composite number with 8 divisors. Its prime factorisation is × 1171. Divisors (8): 1, 2, 4, 8, 1171, 2342, 4684, 9368.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9368: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
9368 is composite. Its prime factorisation is
- 3
The divisors add up to 17580; without 9368 itself that is 8212, so 9368 is deficient (8212 is less than 9368). Euler's totient φ(9368) = 4680 numbers up to 9368 share no factor with it.
- 4
The digits of 9368 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9368 = 2^{3} \times 1171 \]9368 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17580 |
| Euler totient φ(n) | 4680 |
| Square | 87759424 |
| Cube | 822130284032 |
| Square root | 96.788429 (= 2√2342) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.368 × |
9368 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and sixty-eight |
| Binary (base 2) | 10010010011000 |
| Octal (base 8) | 22230 |
| Hexadecimal (base 16) | 2498 |
| Base 3 | 110211222 |
| As time | 9368 seconds = 2 h 36 min 8 s |
Is 9368 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9368 ÷ 2 = 4684) | 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 | Yes (9368 ÷ 4 = 2342) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (9368 ÷ 8 = 1171) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9368 a prime number?
No. 9368 = × 1171, so it is divisible by 2.
What are the factors of 9368?
1, 2, 4, 8, 1171, 2342, 4684, 9368.
What is 9368 in binary?
10010010011000 (hexadecimal 2498, octal 22230).
What is the square root of 9368?
About 96.7884, exactly 2√2342.
Is 9368 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 9368?
9368 is a happy number: repeatedly adding the squares of its digits reaches 1.