The number 50572
50572 is a composite number with 12 divisors. Its prime factorisation is × 47 × 269. Divisors (12): 1, 2, 4, 47, 94, 188, 269, 538, 1076, 12643, 25286, 50572.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50572: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50572 is composite. Its prime factorisation is
- 3
The divisors add up to 90720; without 50572 itself that is 40148, so 50572 is deficient (40148 is less than 50572). Euler's totient φ(50572) = 24656 numbers up to 50572 share no factor with it.
- 4
The digits of 50572 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50572 = 2^{2} \times 47 \times 269 \]50572 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 90720 |
| Euler totient φ(n) | 24656 |
| Square | 2557527184 |
| Cube | 129339264749248 |
| Square root | 224.882191 (= 2√12643) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0572 × |
50572 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and seventy-two |
| Binary (base 2) | 1100010110001100 |
| Octal (base 8) | 142614 |
| Hexadecimal (base 16) | C58C |
| Base 3 | 2120101001 |
| As time | 50572 seconds = 14 h 2 min 52 s |
Is 50572 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50572 ÷ 2 = 25286) | 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 | Yes (50572 ÷ 4 = 12643) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50572 a prime number?
No. 50572 = × 47 × 269, so it is divisible by 2.
What are the factors of 50572?
1, 2, 4, 47, 94, 188, 269, 538, 1076, 12643, 25286, 50572.
What is 50572 in binary?
1100010110001100 (hexadecimal C58C, octal 142614).
What is the square root of 50572?
About 224.8822, exactly 2√12643.
Is 50572 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50572?
50572 is a happy number: repeatedly adding the squares of its digits reaches 1.