The number 95938
95938 is a composite number with 4 divisors. Its prime factorisation is 2 × 47969. Divisors (4): 1, 2, 47969, 95938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95938: a semiprime: 2 × 47969, the product of two primes.
- 2
95938 is composite. Its prime factorisation is
- 3
The divisors add up to 143910; without 95938 itself that is 47972, so 95938 is deficient (47972 is less than 95938). Euler's totient φ(95938) = 47968 numbers up to 95938 share no factor with it.
- 4
The digits of 95938 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95938 = 2 \times 47969 \]
95938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 143910 |
| Euler totient φ(n) | 47968 |
| Square | 9204099844 |
| Cube | 883022930833672 |
| Square root | 309.738599 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.5938 × |
95938 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and thirty-eight |
| Binary (base 2) | 10111011011000010 |
| Octal (base 8) | 273302 |
| Hexadecimal (base 16) | 176C2 |
| Base 3 | 11212121021 |
| As time | 95938 seconds = 26 h 38 min 58 s |
Is 95938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95938 ÷ 2 = 47969) | 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 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 2) | 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 95938 a prime number?
No. 95938 = 2 × 47969, so it is divisible by 2.
What are the factors of 95938?
1, 2, 47969, 95938.
What is 95938 in binary?
10111011011000010 (hexadecimal 176C2, octal 273302).
What is the square root of 95938?
About 309.7386.
Is 95938 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 95938?
95938 is a semiprime: 2 × 47969, the product of two primes.