The number 93959
93959 is a composite number with 4 divisors. Its prime factorisation is 17 × 5527. Divisors (4): 1, 17, 5527, 93959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93959: a semiprime: 17 × 5527, the product of two primes.
- 2
93959 is composite. Its prime factorisation is
- 3
The divisors add up to 99504; without 93959 itself that is 5545, so 93959 is deficient (5545 is less than 93959). Euler's totient φ(93959) = 88416 numbers up to 93959 share no factor with it.
- 4
The digits of 93959 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93959 = 17 \times 5527 \]
93959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 99504 |
| Euler totient φ(n) | 88416 |
| Square | 8828293681 |
| Cube | 829497645973079 |
| Square root | 306.527323 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.3959 × |
93959 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and fifty-nine |
| Binary (base 2) | 10110111100000111 |
| Octal (base 8) | 267407 |
| Hexadecimal (base 16) | 16F07 |
| Base 3 | 11202212222 |
| As time | 93959 seconds = 26 h 5 min 59 s |
Is 93959 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 5) | 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 7) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93959 a prime number?
No. 93959 = 17 × 5527, so it is divisible by 17.
What are the factors of 93959?
1, 17, 5527, 93959.
What is 93959 in binary?
10110111100000111 (hexadecimal 16F07, octal 267407).
What is the square root of 93959?
About 306.5273.
Is 93959 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 93959?
93959 is a semiprime: 17 × 5527, the product of two primes.