The number 9390
9390 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 313. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 313, 626, 939, 1565, 1878, 3130, 4695, 9390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9390 is composite. Its prime factorisation is
- 3
The divisors add up to 22608; without 9390 itself that is 13218, so 9390 is abundant (13218 is more than 9390). Euler's totient φ(9390) = 2496 numbers up to 9390 share no factor with it.
- 4
The digits of 9390 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9390 = 2 \times 3 \times 5 \times 313 \]
9390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 22608 |
| Euler totient φ(n) | 2496 |
| Square | 88172100 |
| Cube | 827936019000 |
| Square root | 96.902012 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 109 |
| Scientific notation | 9.39 × |
9390 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and ninety |
| Binary (base 2) | 10010010101110 |
| Octal (base 8) | 22256 |
| Hexadecimal (base 16) | 24AE |
| Base 3 | 110212210 |
| As time | 9390 seconds = 2 h 36 min 30 s |
Is 9390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9390 ÷ 2 = 4695) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9390 ÷ 3 = 3130) | 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 | Yes (9390 ÷ 5 = 1878) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (9390 ÷ 6 = 1565) | 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 6) | 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 | Yes (9390 ÷ 10 = 939) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9390 a prime number?
No. 9390 = 2 × 3 × 5 × 313, so it is divisible by 2.
What are the factors of 9390?
1, 2, 3, 5, 6, 10, 15, 30, 313, 626, 939, 1565, 1878, 3130, 4695, 9390.
What is 9390 in binary?
10010010101110 (hexadecimal 24AE, octal 22256).
What is the square root of 9390?
About 96.9020.
Is 9390 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9390?
It is a composite number with 16 divisors.