The number 95590
95590 is a composite number with 24 divisors. Its prime factorisation is 2 × 5 × × 79. Divisors (24): 1, 2, 5, 10, 11, 22, 55, 79, 110, 121, 158, 242, 395, 605, 790, 869 … 95590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95590 is composite. Its prime factorisation is
- 3
The divisors add up to 191520; without 95590 itself that is 95930, so 95590 is abundant (95930 is more than 95590). Euler's totient φ(95590) = 34320 numbers up to 95590 share no factor with it.
- 4
The digits of 95590 add up to 28, 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
\[ 95590 = 2 \times 5 \times 11^{2} \times 79 \]95590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 191520 |
| Euler totient φ(n) | 34320 |
| Square | 9137448100 |
| Cube | 873448663879000 |
| Square root | 309.176325 (= 11√790) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.559 × |
95590 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand five hundred and ninety |
| Binary (base 2) | 10111010101100110 |
| Octal (base 8) | 272546 |
| Hexadecimal (base 16) | 17566 |
| Base 3 | 11212010101 |
| As time | 95590 seconds = 26 h 33 min 10 s |
Is 95590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95590 ÷ 2 = 47795) | 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 | Yes (95590 ÷ 5 = 19118) | 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 | No (remainder 6) | 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 | Yes (95590 ÷ 10 = 9559) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (95590 ÷ 11 = 8690) | 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 95590 a prime number?
No. 95590 = 2 × 5 × × 79, so it is divisible by 2.
What are the factors of 95590?
1, 2, 5, 10, 11, 22, 55, 79, 110, 121, 158, 242, 395, 605, 790, 869, 1210, 1738, 4345, 8690, 9559, 19118, 47795, 95590.
What is 95590 in binary?
10111010101100110 (hexadecimal 17566, octal 272546).
What is the square root of 95590?
About 309.1763, exactly 11√790.
Is 95590 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 95590?
It is a composite number with 24 divisors.