The number 95958
95958 is a composite number with 16 divisors. Its prime factorisation is 2 × × 1777. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 54, 1777, 3554, 5331, 10662, 15993, 31986, 47979, 95958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95958 is composite. Its prime factorisation is
- 3
The divisors add up to 213360; without 95958 itself that is 117402, so 95958 is abundant (117402 is more than 95958). Euler's totient φ(95958) = 31968 numbers up to 95958 share no factor with it.
- 4
The digits of 95958 add up to 36, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95958 = 2 \times 3^{3} \times 1777 \]95958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 213360 |
| Euler totient φ(n) | 31968 |
| Square | 9207937764 |
| Cube | 883575291957912 |
| Square root | 309.770883 (= 3√10662) |
| Digit sum / digital root | 36 / 9 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.5958 × |
95958 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and fifty-eight |
| Binary (base 2) | 10111011011010110 |
| Octal (base 8) | 273326 |
| Hexadecimal (base 16) | 176D6 |
| Base 3 | 11212122000 |
| As time | 95958 seconds = 26 h 39 min 18 s |
Is 95958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95958 ÷ 2 = 47979) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (95958 ÷ 3 = 31986) | 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 | Yes (95958 ÷ 6 = 15993) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (95958 ÷ 9 = 10662) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95958 a prime number?
No. 95958 = 2 × × 1777, so it is divisible by 2.
What are the factors of 95958?
1, 2, 3, 6, 9, 18, 27, 54, 1777, 3554, 5331, 10662, 15993, 31986, 47979, 95958.
What is 95958 in binary?
10111011011010110 (hexadecimal 176D6, octal 273326).
What is the square root of 95958?
About 309.7709, exactly 3√10662.
Is 95958 divisible by 3?
Yes. Its digits add up to 36, a multiple of 3.
What is special about the number 95958?
It is a composite number with 16 divisors.