The number 56050
56050 is a composite number with 24 divisors. Its prime factorisation is 2 × × 19 × 59. Divisors (24): 1, 2, 5, 10, 19, 25, 38, 50, 59, 95, 118, 190, 295, 475, 590, 950 … 56050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56050: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
56050 is composite. Its prime factorisation is
- 3
The divisors add up to 111600; without 56050 itself that is 55550, so 56050 is deficient (55550 is less than 56050). Euler's totient φ(56050) = 20880 numbers up to 56050 share no factor with it.
- 4
The digits of 56050 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56050 = 2 \times 5^{2} \times 19 \times 59 \]56050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 111600 |
| Euler totient φ(n) | 20880 |
| Square | 3141602500 |
| Cube | 176086820125000 |
| Square root | 236.748812 (= 5√2242) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.605 × |
56050 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and fifty |
| Binary (base 2) | 1101101011110010 |
| Octal (base 8) | 155362 |
| Hexadecimal (base 16) | DAF2 |
| Base 3 | 2211212221 |
| As time | 56050 seconds = 15 h 34 min 10 s |
Is 56050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56050 ÷ 2 = 28025) | 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 (56050 ÷ 5 = 11210) | 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 (56050 ÷ 10 = 5605) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 56050 a prime number?
No. 56050 = 2 × × 19 × 59, so it is divisible by 2.
What are the factors of 56050?
1, 2, 5, 10, 19, 25, 38, 50, 59, 95, 118, 190, 295, 475, 590, 950, 1121, 1475, 2242, 2950, 5605, 11210, 28025, 56050.
What is 56050 in binary?
1101101011110010 (hexadecimal DAF2, octal 155362).
What is the square root of 56050?
About 236.7488, exactly 5√2242.
Is 56050 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 56050?
56050 is a happy number: repeatedly adding the squares of its digits reaches 1.