The number 55642
55642 is a composite number with 8 divisors. Its prime factorisation is 2 × 43 × 647. Divisors (8): 1, 2, 43, 86, 647, 1294, 27821, 55642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55642 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55642 is composite. Its prime factorisation is
- 3
The divisors add up to 85536; without 55642 itself that is 29894, so 55642 is deficient (29894 is less than 55642). Euler's totient φ(55642) = 27132 numbers up to 55642 share no factor with it.
- 4
The digits of 55642 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55642 = 2 \times 43 \times 647 \]
55642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 85536 |
| Euler totient φ(n) | 27132 |
| Square | 3096032164 |
| Cube | 172269421669288 |
| Square root | 235.885565 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5642 × |
55642 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand six hundred and forty-two |
| Binary (base 2) | 1101100101011010 |
| Octal (base 8) | 154532 |
| Hexadecimal (base 16) | D95A |
| Base 3 | 2211022211 |
| As time | 55642 seconds = 15 h 27 min 22 s |
Is 55642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55642 ÷ 2 = 27821) | 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 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55642 a prime number?
No. 55642 = 2 × 43 × 647, so it is divisible by 2.
What are the factors of 55642?
1, 2, 43, 86, 647, 1294, 27821, 55642.
What is 55642 in binary?
1101100101011010 (hexadecimal D95A, octal 154532).
What is the square root of 55642?
About 235.8856.
Is 55642 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 55642?
It is a composite number with 8 divisors.