The number 50060
50060 is a composite number with 12 divisors. Its prime factorisation is × 5 × 2503. Divisors (12): 1, 2, 4, 5, 10, 20, 2503, 5006, 10012, 12515, 25030, 50060.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50060 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50060 is composite. Its prime factorisation is
- 3
The divisors add up to 105168; without 50060 itself that is 55108, so 50060 is abundant (55108 is more than 50060). Euler's totient φ(50060) = 20016 numbers up to 50060 share no factor with it.
- 4
The digits of 50060 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50060 = 2^{2} \times 5 \times 2503 \]50060 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 105168 |
| Euler totient φ(n) | 20016 |
| Square | 2506003600 |
| Cube | 125450540216000 |
| Square root | 223.740922 (= 2√12515) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.006 × |
50060 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and sixty |
| Binary (base 2) | 1100001110001100 |
| Octal (base 8) | 141614 |
| Hexadecimal (base 16) | C38C |
| Base 3 | 2112200002 |
| As time | 50060 seconds = 13 h 54 min 20 s |
Is 50060 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50060 ÷ 2 = 25030) | 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 (50060 ÷ 4 = 12515) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50060 ÷ 5 = 10012) | 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 3) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50060 ÷ 10 = 5006) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 50060 a prime number?
No. 50060 = × 5 × 2503, so it is divisible by 2.
What are the factors of 50060?
1, 2, 4, 5, 10, 20, 2503, 5006, 10012, 12515, 25030, 50060.
What is 50060 in binary?
1100001110001100 (hexadecimal C38C, octal 141614).
What is the square root of 50060?
About 223.7409, exactly 2√12515.
Is 50060 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 50060?
It is a composite number with 12 divisors.