The number 50010
50010 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1667. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1667, 3334, 5001, 8335, 10002, 16670, 25005, 50010.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50010: a Harshad number: divisible by its digit sum 6.
- 2
50010 is composite. Its prime factorisation is
- 3
The divisors add up to 120096; without 50010 itself that is 70086, so 50010 is abundant (70086 is more than 50010). Euler's totient φ(50010) = 13328 numbers up to 50010 share no factor with it.
- 4
The digits of 50010 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50010 = 2 \times 3 \times 5 \times 1667 \]
50010 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 120096 |
| Euler totient φ(n) | 13328 |
| Square | 2501000100 |
| Cube | 125075015001000 |
| Square root | 223.629157 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.001 × |
50010 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and ten |
| Binary (base 2) | 1100001101011010 |
| Octal (base 8) | 141532 |
| Hexadecimal (base 16) | C35A |
| Base 3 | 2112121020 |
| As time | 50010 seconds = 13 h 53 min 30 s |
Is 50010 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50010 ÷ 2 = 25005) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50010 ÷ 3 = 16670) | 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 (50010 ÷ 5 = 10002) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50010 ÷ 6 = 8335) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50010 ÷ 10 = 5001) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50010 a prime number?
No. 50010 = 2 × 3 × 5 × 1667, so it is divisible by 2.
What are the factors of 50010?
1, 2, 3, 5, 6, 10, 15, 30, 1667, 3334, 5001, 8335, 10002, 16670, 25005, 50010.
What is 50010 in binary?
1100001101011010 (hexadecimal C35A, octal 141532).
What is the square root of 50010?
About 223.6292.
Is 50010 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 50010?
50010 is a Harshad number: divisible by its digit sum 6.