The number 50272
50272 is a composite number with 12 divisors. Its prime factorisation is × 1571. Divisors (12): 1, 2, 4, 8, 16, 32, 1571, 3142, 6284, 12568, 25136, 50272.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50272: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.
- 2
50272 is composite. Its prime factorisation is
- 3
The divisors add up to 99036; without 50272 itself that is 48764, so 50272 is deficient (48764 is less than 50272). Euler's totient φ(50272) = 25120 numbers up to 50272 share no factor with it.
- 4
The digits of 50272 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50272 = 2^{5} \times 1571 \]50272 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 99036 |
| Euler totient φ(n) | 25120 |
| Square | 2527273984 |
| Cube | 127051117723648 |
| Square root | 224.214183 (= 4√3142) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0272 × |
50272 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and seventy-two |
| Binary (base 2) | 1100010001100000 |
| Octal (base 8) | 142140 |
| Hexadecimal (base 16) | C460 |
| Base 3 | 2112221221 |
| As time | 50272 seconds = 13 h 57 min 52 s |
Is 50272 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50272 ÷ 2 = 25136) | 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 (50272 ÷ 4 = 12568) | 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 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 | Yes (50272 ÷ 8 = 6284) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 50272 a prime number?
No. 50272 = × 1571, so it is divisible by 2.
What are the factors of 50272?
1, 2, 4, 8, 16, 32, 1571, 3142, 6284, 12568, 25136, 50272.
What is 50272 in binary?
1100010001100000 (hexadecimal C460, octal 142140).
What is the square root of 50272?
About 224.2142, exactly 4√3142.
Is 50272 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50272?
50272 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.