The number 55495
55495 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 1009. Divisors (8): 1, 5, 11, 55, 1009, 5045, 11099, 55495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55495 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55495 is composite. Its prime factorisation is
- 3
The divisors add up to 72720; without 55495 itself that is 17225, so 55495 is deficient (17225 is less than 55495). Euler's totient φ(55495) = 40320 numbers up to 55495 share no factor with it.
- 4
The digits of 55495 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55495 = 5 \times 11 \times 1009 \]
55495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72720 |
| Euler totient φ(n) | 40320 |
| Square | 3079695025 |
| Cube | 170907675412375 |
| Square root | 235.573768 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5495 × |
55495 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and ninety-five |
| Binary (base 2) | 1101100011000111 |
| Octal (base 8) | 154307 |
| Hexadecimal (base 16) | D8C7 |
| Base 3 | 2211010101 |
| As time | 55495 seconds = 15 h 24 min 55 s |
Is 55495 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 1) | 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 (55495 ÷ 5 = 11099) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | 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 | Yes (55495 ÷ 11 = 5045) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55495 a prime number?
No. 55495 = 5 × 11 × 1009, so it is divisible by 5.
What are the factors of 55495?
1, 5, 11, 55, 1009, 5045, 11099, 55495.
What is 55495 in binary?
1101100011000111 (hexadecimal D8C7, octal 154307).
What is the square root of 55495?
About 235.5738.
Is 55495 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 55495?
It is a composite number with 8 divisors.