The number 95968
95968 is a composite number with 12 divisors. Its prime factorisation is × 2999. Divisors (12): 1, 2, 4, 8, 16, 32, 2999, 5998, 11996, 23992, 47984, 95968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95968 is composite. Its prime factorisation is
- 3
The divisors add up to 189000; without 95968 itself that is 93032, so 95968 is deficient (93032 is less than 95968). Euler's totient φ(95968) = 47968 numbers up to 95968 share no factor with it.
- 4
The digits of 95968 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95968 = 2^{5} \times 2999 \]95968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 189000 |
| Euler totient φ(n) | 47968 |
| Square | 9209857024 |
| Cube | 883851558879232 |
| Square root | 309.787024 (= 4√5998) |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.5968 × |
95968 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and sixty-eight |
| Binary (base 2) | 10111011011100000 |
| Octal (base 8) | 273340 |
| Hexadecimal (base 16) | 176E0 |
| Base 3 | 11212122101 |
| As time | 95968 seconds = 26 h 39 min 28 s |
Is 95968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95968 ÷ 2 = 47984) | 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 | Yes (95968 ÷ 4 = 23992) | 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 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 | Yes (95968 ÷ 8 = 11996) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95968 a prime number?
No. 95968 = × 2999, so it is divisible by 2.
What are the factors of 95968?
1, 2, 4, 8, 16, 32, 2999, 5998, 11996, 23992, 47984, 95968.
What is 95968 in binary?
10111011011100000 (hexadecimal 176E0, octal 273340).
What is the square root of 95968?
About 309.7870, exactly 4√5998.
Is 95968 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 95968?
It is a composite number with 12 divisors.