The number 93968
93968 is a composite number with 20 divisors. Its prime factorisation is × 7 × 839. Divisors (20): 1, 2, 4, 7, 8, 14, 16, 28, 56, 112, 839, 1678, 3356, 5873, 6712, 11746 … 93968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93968 is composite. Its prime factorisation is
- 3
The divisors add up to 208320; without 93968 itself that is 114352, so 93968 is abundant (114352 is more than 93968). Euler's totient φ(93968) = 40224 numbers up to 93968 share no factor with it.
- 4
The digits of 93968 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93968 = 2^{4} \times 7 \times 839 \]93968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 208320 |
| Euler totient φ(n) | 40224 |
| Square | 8829985024 |
| Cube | 829736032735232 |
| Square root | 306.542004 (= 4√5873) |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 102 |
| Scientific notation | 9.3968 × |
93968 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and sixty-eight |
| Binary (base 2) | 10110111100010000 |
| Octal (base 8) | 267420 |
| Hexadecimal (base 16) | 16F10 |
| Base 3 | 11202220022 |
| As time | 93968 seconds = 26 h 6 min 8 s |
Is 93968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93968 ÷ 2 = 46984) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (93968 ÷ 4 = 23492) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (93968 ÷ 7 = 13424) | 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 | Yes (93968 ÷ 8 = 11746) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93968 a prime number?
No. 93968 = × 7 × 839, so it is divisible by 2.
What are the factors of 93968?
1, 2, 4, 7, 8, 14, 16, 28, 56, 112, 839, 1678, 3356, 5873, 6712, 11746, 13424, 23492, 46984, 93968.
What is 93968 in binary?
10110111100010000 (hexadecimal 16F10, octal 267420).
What is the square root of 93968?
About 306.5420, exactly 4√5873.
Is 93968 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 93968?
It is a composite number with 20 divisors.