The number 56650
56650 is a composite number with 24 divisors. Its prime factorisation is 2 × × 11 × 103. Divisors (24): 1, 2, 5, 10, 11, 22, 25, 50, 55, 103, 110, 206, 275, 515, 550, 1030 … 56650.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56650: a Harshad number: divisible by its digit sum 22.
- 2
56650 is composite. Its prime factorisation is
- 3
The divisors add up to 116064; without 56650 itself that is 59414, so 56650 is abundant (59414 is more than 56650). Euler's totient φ(56650) = 20400 numbers up to 56650 share no factor with it.
- 4
The digits of 56650 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 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56650 = 2 \times 5^{2} \times 11 \times 103 \]56650 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 116064 |
| Euler totient φ(n) | 20400 |
| Square | 3209222500 |
| Cube | 181802454625000 |
| Square root | 238.012605 (= 5√2266) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.665 × |
56650 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand six hundred and fifty |
| Binary (base 2) | 1101110101001010 |
| Octal (base 8) | 156512 |
| Hexadecimal (base 16) | DD4A |
| Base 3 | 2212201011 |
| As time | 56650 seconds = 15 h 44 min 10 s |
Is 56650 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56650 ÷ 2 = 28325) | 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 | Yes (56650 ÷ 5 = 11330) | 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 | Yes (56650 ÷ 10 = 5665) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56650 ÷ 11 = 5150) | 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 56650 a prime number?
No. 56650 = 2 × × 11 × 103, so it is divisible by 2.
What are the factors of 56650?
1, 2, 5, 10, 11, 22, 25, 50, 55, 103, 110, 206, 275, 515, 550, 1030, 1133, 2266, 2575, 5150, 5665, 11330, 28325, 56650.
What is 56650 in binary?
1101110101001010 (hexadecimal DD4A, octal 156512).
What is the square root of 56650?
About 238.0126, exactly 5√2266.
Is 56650 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 56650?
56650 is a Harshad number: divisible by its digit sum 22.