The number 95565
95565 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 23 × 277. Divisors (16): 1, 3, 5, 15, 23, 69, 115, 277, 345, 831, 1385, 4155, 6371, 19113, 31855, 95565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95565: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
95565 is composite. Its prime factorisation is
- 3
The divisors add up to 160128; without 95565 itself that is 64563, so 95565 is deficient (64563 is less than 95565). Euler's totient φ(95565) = 48576 numbers up to 95565 share no factor with it.
- 4
The digits of 95565 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 252 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95565 = 3 \times 5 \times 23 \times 277 \]
95565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 160128 |
| Euler totient φ(n) | 48576 |
| Square | 9132669225 |
| Cube | 872763534487125 |
| Square root | 309.135892 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 252 |
| Scientific notation | 9.5565 × |
95565 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand five hundred and sixty-five |
| Binary (base 2) | 10111010101001101 |
| Octal (base 8) | 272515 |
| Hexadecimal (base 16) | 1754D |
| Base 3 | 11212002110 |
| As time | 95565 seconds = 26 h 32 min 45 s |
Is 95565 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (95565 ÷ 3 = 31855) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (95565 ÷ 5 = 19113) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95565 a prime number?
No. 95565 = 3 × 5 × 23 × 277, so it is divisible by 3.
What are the factors of 95565?
1, 3, 5, 15, 23, 69, 115, 277, 345, 831, 1385, 4155, 6371, 19113, 31855, 95565.
What is 95565 in binary?
10111010101001101 (hexadecimal 1754D, octal 272515).
What is the square root of 95565?
About 309.1359.
Is 95565 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 95565?
95565 is a happy number: repeatedly adding the squares of its digits reaches 1.