The number 50072
50072 is a composite number with 16 divisors. Its prime factorisation is × 11 × 569. Divisors (16): 1, 2, 4, 8, 11, 22, 44, 88, 569, 1138, 2276, 4552, 6259, 12518, 25036, 50072.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50072 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50072 is composite. Its prime factorisation is
- 3
The divisors add up to 102600; without 50072 itself that is 52528, so 50072 is abundant (52528 is more than 50072). Euler's totient φ(50072) = 22720 numbers up to 50072 share no factor with it.
- 4
The digits of 50072 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50072 = 2^{3} \times 11 \times 569 \]50072 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 102600 |
| Euler totient φ(n) | 22720 |
| Square | 2507205184 |
| Cube | 125540777973248 |
| Square root | 223.767737 (= 2√12518) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0072 × |
50072 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and seventy-two |
| Binary (base 2) | 1100001110011000 |
| Octal (base 8) | 141630 |
| Hexadecimal (base 16) | C398 |
| Base 3 | 2112200112 |
| As time | 50072 seconds = 13 h 54 min 32 s |
Is 50072 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50072 ÷ 2 = 25036) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50072 ÷ 4 = 12518) | 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 2) | 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 | Yes (50072 ÷ 8 = 6259) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | Yes (50072 ÷ 11 = 4552) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50072 a prime number?
No. 50072 = × 11 × 569, so it is divisible by 2.
What are the factors of 50072?
1, 2, 4, 8, 11, 22, 44, 88, 569, 1138, 2276, 4552, 6259, 12518, 25036, 50072.
What is 50072 in binary?
1100001110011000 (hexadecimal C398, octal 141630).
What is the square root of 50072?
About 223.7677, exactly 2√12518.
Is 50072 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50072?
It is a composite number with 16 divisors.