The number 95558
95558 is a composite number with 4 divisors. Its prime factorisation is 2 × 47779. Divisors (4): 1, 2, 47779, 95558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95558: a semiprime: 2 × 47779, the product of two primes.
- 2
95558 is composite. Its prime factorisation is
- 3
The divisors add up to 143340; without 95558 itself that is 47782, so 95558 is deficient (47782 is less than 95558). Euler's totient φ(95558) = 47778 numbers up to 95558 share no factor with it.
- 4
The digits of 95558 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95558 = 2 \times 47779 \]
95558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 143340 |
| Euler totient φ(n) | 47778 |
| Square | 9131331364 |
| Cube | 872571762481112 |
| Square root | 309.124570 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.5558 × |
95558 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand five hundred and fifty-eight |
| Binary (base 2) | 10111010101000110 |
| Octal (base 8) | 272506 |
| Hexadecimal (base 16) | 17546 |
| Base 3 | 11212002012 |
| As time | 95558 seconds = 26 h 32 min 38 s |
Is 95558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95558 ÷ 2 = 47779) | 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 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | No (remainder 5) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95558 a prime number?
No. 95558 = 2 × 47779, so it is divisible by 2.
What are the factors of 95558?
1, 2, 47779, 95558.
What is 95558 in binary?
10111010101000110 (hexadecimal 17546, octal 272506).
What is the square root of 95558?
About 309.1246.
Is 95558 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 95558?
95558 is a semiprime: 2 × 47779, the product of two primes.