The number 55862
55862 is a composite number with 16 divisors. Its prime factorisation is 2 × 17 × 31 × 53. Divisors (16): 1, 2, 17, 31, 34, 53, 62, 106, 527, 901, 1054, 1643, 1802, 3286, 27931, 55862.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55862 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55862 is composite. Its prime factorisation is
- 3
The divisors add up to 93312; without 55862 itself that is 37450, so 55862 is deficient (37450 is less than 55862). Euler's totient φ(55862) = 24960 numbers up to 55862 share no factor with it.
- 4
The digits of 55862 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55862 = 2 \times 17 \times 31 \times 53 \]
55862 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93312 |
| Euler totient φ(n) | 24960 |
| Square | 3120563044 |
| Cube | 174320892763928 |
| Square root | 236.351433 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.5862 × |
55862 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand eight hundred and sixty-two |
| Binary (base 2) | 1101101000110110 |
| Octal (base 8) | 155066 |
| Hexadecimal (base 16) | DA36 |
| Base 3 | 2211121222 |
| As time | 55862 seconds = 15 h 31 min 2 s |
Is 55862 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55862 ÷ 2 = 27931) | 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 2) | 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 6) | 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 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55862 a prime number?
No. 55862 = 2 × 17 × 31 × 53, so it is divisible by 2.
What are the factors of 55862?
1, 2, 17, 31, 34, 53, 62, 106, 527, 901, 1054, 1643, 1802, 3286, 27931, 55862.
What is 55862 in binary?
1101101000110110 (hexadecimal DA36, octal 155066).
What is the square root of 55862?
About 236.3514.
Is 55862 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 55862?
It is a composite number with 16 divisors.