The number 9361
9361 is a composite number with 8 divisors. Its prime factorisation is 11 × 23 × 37. Divisors (8): 1, 11, 23, 37, 253, 407, 851, 9361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9361 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9361 is composite. Its prime factorisation is
- 3
The divisors add up to 10944; without 9361 itself that is 1583, so 9361 is deficient (1583 is less than 9361). Euler's totient φ(9361) = 7920 numbers up to 9361 share no factor with it.
- 4
The digits of 9361 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9361 = 11 \times 23 \times 37 \]
9361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 10944 |
| Euler totient φ(n) | 7920 |
| Square | 87628321 |
| Cube | 820288712881 |
| Square root | 96.752261 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 47 |
| Scientific notation | 9.361 × |
9361 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and sixty-one |
| Binary (base 2) | 10010010010001 |
| Octal (base 8) | 22221 |
| Hexadecimal (base 16) | 2491 |
| Base 3 | 110211201 |
| As time | 9361 seconds = 2 h 36 min 1 s |
Is 9361 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 | No (remainder 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (9361 ÷ 11 = 851) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9361 a prime number?
No. 9361 = 11 × 23 × 37, so it is divisible by 11.
What are the factors of 9361?
1, 11, 23, 37, 253, 407, 851, 9361.
What is 9361 in binary?
10010010010001 (hexadecimal 2491, octal 22221).
What is the square root of 9361?
About 96.7523.
Is 9361 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 9361?
It is a composite number with 8 divisors.