The number 5650
5650 is a composite number with 12 divisors. Its prime factorisation is 2 × × 113. Divisors (12): 1, 2, 5, 10, 25, 50, 113, 226, 565, 1130, 2825, 5650.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5650: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
5650 is composite. Its prime factorisation is
- 3
The divisors add up to 10602; without 5650 itself that is 4952, so 5650 is deficient (4952 is less than 5650). Euler's totient φ(5650) = 2240 numbers up to 5650 share no factor with it.
- 4
The digits of 5650 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5650 = 2 \times 5^{2} \times 113 \]5650 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 10602 |
| Euler totient φ(n) | 2240 |
| Square | 31922500 |
| Cube | 180362125000 |
| Square root | 75.166482 (= 5√226) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 85 |
| Scientific notation | 5.65 × |
5650 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and fifty |
| Binary (base 2) | 1011000010010 |
| Octal (base 8) | 13022 |
| Hexadecimal (base 16) | 1612 |
| Base 3 | 21202021 |
| As time | 5650 seconds = 1 h 34 min 10 s |
Is 5650 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5650 ÷ 2 = 2825) | 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 (5650 ÷ 5 = 1130) | 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 1) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5650 ÷ 10 = 565) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 5650 a prime number?
No. 5650 = 2 × × 113, so it is divisible by 2.
What are the factors of 5650?
1, 2, 5, 10, 25, 50, 113, 226, 565, 1130, 2825, 5650.
What is 5650 in binary?
1011000010010 (hexadecimal 1612, octal 13022).
What is the square root of 5650?
About 75.1665, exactly 5√226.
Is 5650 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5650?
5650 is a happy number: repeatedly adding the squares of its digits reaches 1.