The number 95555
95555 is a composite number with 8 divisors. Its prime factorisation is 5 × 29 × 659. Divisors (8): 1, 5, 29, 145, 659, 3295, 19111, 95555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95555: a Harshad number: divisible by its digit sum 29.
- 2
95555 is composite. Its prime factorisation is
- 3
The divisors add up to 118800; without 95555 itself that is 23245, so 95555 is deficient (23245 is less than 95555). Euler's totient φ(95555) = 73696 numbers up to 95555 share no factor with it.
- 4
The digits of 95555 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95555 = 5 \times 29 \times 659 \]
95555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 118800 |
| Euler totient φ(n) | 73696 |
| Square | 9130758025 |
| Cube | 872489583078875 |
| Square root | 309.119718 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.5555 × |
95555 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand five hundred and fifty-five |
| Binary (base 2) | 10111010101000011 |
| Octal (base 8) | 272503 |
| Hexadecimal (base 16) | 17543 |
| Base 3 | 11212002002 |
| As time | 95555 seconds = 26 h 32 min 35 s |
Is 95555 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (95555 ÷ 5 = 19111) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95555 a prime number?
No. 95555 = 5 × 29 × 659, so it is divisible by 5.
What are the factors of 95555?
1, 5, 29, 145, 659, 3295, 19111, 95555.
What is 95555 in binary?
10111010101000011 (hexadecimal 17543, octal 272503).
What is the square root of 95555?
About 309.1197.
Is 95555 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 95555?
95555 is a Harshad number: divisible by its digit sum 29.