The number 93957
93957 is a composite number with 4 divisors. Its prime factorisation is 3 × 31319. Divisors (4): 1, 3, 31319, 93957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93957: a semiprime: 3 × 31319, the product of two primes.
- 2
93957 is composite. Its prime factorisation is
- 3
The divisors add up to 125280; without 93957 itself that is 31323, so 93957 is deficient (31323 is less than 93957). Euler's totient φ(93957) = 62636 numbers up to 93957 share no factor with it.
- 4
The digits of 93957 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93957 = 3 \times 31319 \]
93957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 125280 |
| Euler totient φ(n) | 62636 |
| Square | 8827917849 |
| Cube | 829444677338493 |
| Square root | 306.524061 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3957 × |
93957 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and fifty-seven |
| Binary (base 2) | 10110111100000101 |
| Octal (base 8) | 267405 |
| Hexadecimal (base 16) | 16F05 |
| Base 3 | 11202212220 |
| As time | 93957 seconds = 26 h 5 min 57 s |
Is 93957 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 (93957 ÷ 3 = 31319) | 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 2) | 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 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 5) | 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 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93957 a prime number?
No. 93957 = 3 × 31319, so it is divisible by 3.
What are the factors of 93957?
1, 3, 31319, 93957.
What is 93957 in binary?
10110111100000101 (hexadecimal 16F05, octal 267405).
What is the square root of 93957?
About 306.5241.
Is 93957 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 93957?
93957 is a semiprime: 3 × 31319, the product of two primes.