The number 93958
93958 is a composite number with 8 divisors. Its prime factorisation is 2 × 109 × 431. Divisors (8): 1, 2, 109, 218, 431, 862, 46979, 93958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93958 is composite. Its prime factorisation is
- 3
The divisors add up to 142560; without 93958 itself that is 48602, so 93958 is deficient (48602 is less than 93958). Euler's totient φ(93958) = 46440 numbers up to 93958 share no factor with it.
- 4
The digits of 93958 add up to 34, 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
\[ 93958 = 2 \times 109 \times 431 \]
93958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 142560 |
| Euler totient φ(n) | 46440 |
| Square | 8828105764 |
| Cube | 829471161373912 |
| Square root | 306.525692 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3958 × |
93958 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and fifty-eight |
| Binary (base 2) | 10110111100000110 |
| Octal (base 8) | 267406 |
| Hexadecimal (base 16) | 16F06 |
| Base 3 | 11202212221 |
| As time | 93958 seconds = 26 h 5 min 58 s |
Is 93958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93958 ÷ 2 = 46979) | 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 | No (remainder 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 7) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93958 a prime number?
No. 93958 = 2 × 109 × 431, so it is divisible by 2.
What are the factors of 93958?
1, 2, 109, 218, 431, 862, 46979, 93958.
What is 93958 in binary?
10110111100000110 (hexadecimal 16F06, octal 267406).
What is the square root of 93958?
About 306.5257.
Is 93958 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 93958?
It is a composite number with 8 divisors.