The number 55565
55565 is a composite number with 4 divisors. Its prime factorisation is 5 × 11113. Divisors (4): 1, 5, 11113, 55565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55565: a semiprime: 5 × 11113, the product of two primes.
- 2
55565 is composite. Its prime factorisation is
- 3
The divisors add up to 66684; without 55565 itself that is 11119, so 55565 is deficient (11119 is less than 55565). Euler's totient φ(55565) = 44448 numbers up to 55565 share no factor with it.
- 4
The digits of 55565 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55565 = 5 \times 11113 \]
55565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66684 |
| Euler totient φ(n) | 44448 |
| Square | 3087469225 |
| Cube | 171555227487125 |
| Square root | 235.722294 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.5565 × |
55565 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand five hundred and sixty-five |
| Binary (base 2) | 1101100100001101 |
| Octal (base 8) | 154415 |
| Hexadecimal (base 16) | D90D |
| Base 3 | 2211012222 |
| As time | 55565 seconds = 15 h 26 min 5 s |
Is 55565 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (55565 ÷ 5 = 11113) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55565 a prime number?
No. 55565 = 5 × 11113, so it is divisible by 5.
What are the factors of 55565?
1, 5, 11113, 55565.
What is 55565 in binary?
1101100100001101 (hexadecimal D90D, octal 154415).
What is the square root of 55565?
About 235.7223.
Is 55565 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 55565?
55565 is a semiprime: 5 × 11113, the product of two primes.