The number 56551
56551 is a composite number with 8 divisors. Its prime factorisation is 11 × 53 × 97. Divisors (8): 1, 11, 53, 97, 583, 1067, 5141, 56551.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56551 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56551 is composite. Its prime factorisation is
- 3
The divisors add up to 63504; without 56551 itself that is 6953, so 56551 is deficient (6953 is less than 56551). Euler's totient φ(56551) = 49920 numbers up to 56551 share no factor with it.
- 4
The digits of 56551 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 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56551 = 11 \times 53 \times 97 \]
56551 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 63504 |
| Euler totient φ(n) | 49920 |
| Square | 3198015601 |
| Cube | 180850980252151 |
| Square root | 237.804542 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.6551 × |
56551 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand five hundred and fifty-one |
| Binary (base 2) | 1101110011100111 |
| Octal (base 8) | 156347 |
| Hexadecimal (base 16) | DCE7 |
| Base 3 | 2212120111 |
| As time | 56551 seconds = 15 h 42 min 31 s |
Is 56551 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 | No (remainder 1) | 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 5) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56551 ÷ 11 = 5141) | 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 56551 a prime number?
No. 56551 = 11 × 53 × 97, so it is divisible by 11.
What are the factors of 56551?
1, 11, 53, 97, 583, 1067, 5141, 56551.
What is 56551 in binary?
1101110011100111 (hexadecimal DCE7, octal 156347).
What is the square root of 56551?
About 237.8045.
Is 56551 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 56551?
It is a composite number with 8 divisors.