The number 9381
9381 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 59. Divisors (8): 1, 3, 53, 59, 159, 177, 3127, 9381.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9381 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9381 is composite. Its prime factorisation is
- 3
The divisors add up to 12960; without 9381 itself that is 3579, so 9381 is deficient (3579 is less than 9381). Euler's totient φ(9381) = 6032 numbers up to 9381 share no factor with it.
- 4
The digits of 9381 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9381 = 3 \times 53 \times 59 \]
9381 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 12960 |
| Euler totient φ(n) | 6032 |
| Square | 88003161 |
| Cube | 825557653341 |
| Square root | 96.855563 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 9.381 × |
9381 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and eighty-one |
| Binary (base 2) | 10010010100101 |
| Octal (base 8) | 22245 |
| Hexadecimal (base 16) | 24A5 |
| Base 3 | 110212110 |
| As time | 9381 seconds = 2 h 36 min 21 s |
Is 9381 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 (9381 ÷ 3 = 3127) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | No (remainder 9) | 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 9381 a prime number?
No. 9381 = 3 × 53 × 59, so it is divisible by 3.
What are the factors of 9381?
1, 3, 53, 59, 159, 177, 3127, 9381.
What is 9381 in binary?
10010010100101 (hexadecimal 24A5, octal 22245).
What is the square root of 9381?
About 96.8556.
Is 9381 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9381?
It is a composite number with 8 divisors.