The number 93364
93364 is a composite number with 12 divisors. Its prime factorisation is × 17 × 1373. Divisors (12): 1, 2, 4, 17, 34, 68, 1373, 2746, 5492, 23341, 46682, 93364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93364 is composite. Its prime factorisation is
- 3
The divisors add up to 173124; without 93364 itself that is 79760, so 93364 is deficient (79760 is less than 93364). Euler's totient φ(93364) = 43904 numbers up to 93364 share no factor with it.
- 4
The digits of 93364 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93364 = 2^{2} \times 17 \times 1373 \]93364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 173124 |
| Euler totient φ(n) | 43904 |
| Square | 8716836496 |
| Cube | 813838722612544 |
| Square root | 305.555232 (= 2√23341) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3364 × |
93364 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand three hundred and sixty-four |
| Binary (base 2) | 10110110010110100 |
| Octal (base 8) | 266264 |
| Hexadecimal (base 16) | 16CB4 |
| Base 3 | 11202001221 |
| As time | 93364 seconds = 25 h 56 min 4 s |
Is 93364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93364 ÷ 2 = 46682) | 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 | Yes (93364 ÷ 4 = 23341) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93364 a prime number?
No. 93364 = × 17 × 1373, so it is divisible by 2.
What are the factors of 93364?
1, 2, 4, 17, 34, 68, 1373, 2746, 5492, 23341, 46682, 93364.
What is 93364 in binary?
10110110010110100 (hexadecimal 16CB4, octal 266264).
What is the square root of 93364?
About 305.5552, exactly 2√23341.
Is 93364 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 93364?
It is a composite number with 12 divisors.