The number 9369
9369 is a composite number with 8 divisors. Its prime factorisation is × 347. Divisors (8): 1, 3, 9, 27, 347, 1041, 3123, 9369.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9369: a Harshad number: divisible by its digit sum 27.
- 2
9369 is composite. Its prime factorisation is
- 3
The divisors add up to 13920; without 9369 itself that is 4551, so 9369 is deficient (4551 is less than 9369). Euler's totient φ(9369) = 6228 numbers up to 9369 share no factor with it.
- 4
The digits of 9369 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9369 = 3^{3} \times 347 \]9369 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 13920 |
| Euler totient φ(n) | 6228 |
| Square | 87778161 |
| Cube | 822393590409 |
| Square root | 96.793595 (= 3√1041) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.369 × |
9369 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and sixty-nine |
| Binary (base 2) | 10010010011001 |
| Octal (base 8) | 22231 |
| Hexadecimal (base 16) | 2499 |
| Base 3 | 110212000 |
| As time | 9369 seconds = 2 h 36 min 9 s |
Is 9369 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 (9369 ÷ 3 = 3123) | 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 4) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (9369 ÷ 9 = 1041) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 9369 a prime number?
No. 9369 = × 347, so it is divisible by 3.
What are the factors of 9369?
1, 3, 9, 27, 347, 1041, 3123, 9369.
What is 9369 in binary?
10010010011001 (hexadecimal 2499, octal 22231).
What is the square root of 9369?
About 96.7936, exactly 3√1041.
Is 9369 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 9369?
9369 is a Harshad number: divisible by its digit sum 27.