The number 93964
93964 is a composite number with 18 divisors. Its prime factorisation is × × 139. Divisors (18): 1, 2, 4, 13, 26, 52, 139, 169, 278, 338, 556, 676, 1807, 3614, 7228, 23491 … 93964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93964 is composite. Its prime factorisation is
- 3
The divisors add up to 179340; without 93964 itself that is 85376, so 93964 is deficient (85376 is less than 93964). Euler's totient φ(93964) = 43056 numbers up to 93964 share no factor with it.
- 4
The digits of 93964 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93964 = 2^{2} \times 13^{2} \times 139 \]93964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 179340 |
| Euler totient φ(n) | 43056 |
| Square | 8829233296 |
| Cube | 829630077425344 |
| Square root | 306.535479 (= 26√139) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3964 × |
93964 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and sixty-four |
| Binary (base 2) | 10110111100001100 |
| Octal (base 8) | 267414 |
| Hexadecimal (base 16) | 16F0C |
| Base 3 | 11202220011 |
| As time | 93964 seconds = 26 h 6 min 4 s |
Is 93964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93964 ÷ 2 = 46982) | 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 (93964 ÷ 4 = 23491) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 2) | 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 93964 a prime number?
No. 93964 = × × 139, so it is divisible by 2.
What are the factors of 93964?
1, 2, 4, 13, 26, 52, 139, 169, 278, 338, 556, 676, 1807, 3614, 7228, 23491, 46982, 93964.
What is 93964 in binary?
10110111100001100 (hexadecimal 16F0C, octal 267414).
What is the square root of 93964?
About 306.5355, exactly 26√139.
Is 93964 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 93964?
It is a composite number with 18 divisors.