The number 55695
55695 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 47 × 79. Divisors (16): 1, 3, 5, 15, 47, 79, 141, 235, 237, 395, 705, 1185, 3713, 11139, 18565, 55695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55695: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55695 is composite. Its prime factorisation is
- 3
The divisors add up to 92160; without 55695 itself that is 36465, so 55695 is deficient (36465 is less than 55695). Euler's totient φ(55695) = 28704 numbers up to 55695 share no factor with it.
- 4
The digits of 55695 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55695 = 3 \times 5 \times 47 \times 79 \]
55695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 92160 |
| Euler totient φ(n) | 28704 |
| Square | 3101933025 |
| Cube | 172762159827375 |
| Square root | 235.997881 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.5695 × |
55695 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand six hundred and ninety-five |
| Binary (base 2) | 1101100110001111 |
| Octal (base 8) | 154617 |
| Hexadecimal (base 16) | D98F |
| Base 3 | 2211101210 |
| As time | 55695 seconds = 15 h 28 min 15 s |
Is 55695 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 (55695 ÷ 3 = 18565) | 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 (55695 ÷ 5 = 11139) | 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 3) | 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 7) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55695 a prime number?
No. 55695 = 3 × 5 × 47 × 79, so it is divisible by 3.
What are the factors of 55695?
1, 3, 5, 15, 47, 79, 141, 235, 237, 395, 705, 1185, 3713, 11139, 18565, 55695.
What is 55695 in binary?
1101100110001111 (hexadecimal D98F, octal 154617).
What is the square root of 55695?
About 235.9979.
Is 55695 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 55695?
55695 is a happy number: repeatedly adding the squares of its digits reaches 1.