The number 9393
9393 is a composite number with 8 divisors. Its prime factorisation is 3 × 31 × 101. Divisors (8): 1, 3, 31, 93, 101, 303, 3131, 9393.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9393 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9393 is composite. Its prime factorisation is
- 3
The divisors add up to 13056; without 9393 itself that is 3663, so 9393 is deficient (3663 is less than 9393). Euler's totient φ(9393) = 6000 numbers up to 9393 share no factor with it.
- 4
The digits of 9393 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9393 = 3 \times 31 \times 101 \]
9393 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 13056 |
| Euler totient φ(n) | 6000 |
| Square | 88228449 |
| Cube | 828729821457 |
| Square root | 96.917491 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 109 |
| Scientific notation | 9.393 × |
9393 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and ninety-three |
| Binary (base 2) | 10010010110001 |
| Octal (base 8) | 22261 |
| Hexadecimal (base 16) | 24B1 |
| Base 3 | 110212220 |
| As time | 9393 seconds = 2 h 36 min 33 s |
Is 9393 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 (9393 ÷ 3 = 3131) | 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 3) | 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 6) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 9393 a prime number?
No. 9393 = 3 × 31 × 101, so it is divisible by 3.
What are the factors of 9393?
1, 3, 31, 93, 101, 303, 3131, 9393.
What is 9393 in binary?
10010010110001 (hexadecimal 24B1, octal 22261).
What is the square root of 9393?
About 96.9175.
Is 9393 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 9393?
It is a composite number with 8 divisors.