The number 55562
55562 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 2137. Divisors (8): 1, 2, 13, 26, 2137, 4274, 27781, 55562.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55562 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55562 is composite. Its prime factorisation is
- 3
The divisors add up to 89796; without 55562 itself that is 34234, so 55562 is deficient (34234 is less than 55562). Euler's totient φ(55562) = 25632 numbers up to 55562 share no factor with it.
- 4
The digits of 55562 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55562 = 2 \times 13 \times 2137 \]
55562 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 89796 |
| Euler totient φ(n) | 25632 |
| Square | 3087135844 |
| Cube | 171527441764328 |
| Square root | 235.715931 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.5562 × |
55562 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand five hundred and sixty-two |
| Binary (base 2) | 1101100100001010 |
| Octal (base 8) | 154412 |
| Hexadecimal (base 16) | D90A |
| Base 3 | 2211012212 |
| As time | 55562 seconds = 15 h 26 min 2 s |
Is 55562 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55562 ÷ 2 = 27781) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55562 a prime number?
No. 55562 = 2 × 13 × 2137, so it is divisible by 2.
What are the factors of 55562?
1, 2, 13, 26, 2137, 4274, 27781, 55562.
What is 55562 in binary?
1101100100001010 (hexadecimal D90A, octal 154412).
What is the square root of 55562?
About 235.7159.
Is 55562 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55562?
It is a composite number with 8 divisors.