The number 50030
50030 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5003. Divisors (8): 1, 2, 5, 10, 5003, 10006, 25015, 50030.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50030 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50030 is composite. Its prime factorisation is
- 3
The divisors add up to 90072; without 50030 itself that is 40042, so 50030 is deficient (40042 is less than 50030). Euler's totient φ(50030) = 20008 numbers up to 50030 share no factor with it.
- 4
The digits of 50030 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50030 = 2 \times 5 \times 5003 \]
50030 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90072 |
| Euler totient φ(n) | 20008 |
| Square | 2503000900 |
| Cube | 125225135027000 |
| Square root | 223.673870 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.003 × |
50030 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and thirty |
| Binary (base 2) | 1100001101101110 |
| Octal (base 8) | 141556 |
| Hexadecimal (base 16) | C36E |
| Base 3 | 2112121222 |
| As time | 50030 seconds = 13 h 53 min 50 s |
Is 50030 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50030 ÷ 2 = 25015) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50030 ÷ 5 = 10006) | 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50030 ÷ 10 = 5003) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50030 a prime number?
No. 50030 = 2 × 5 × 5003, so it is divisible by 2.
What are the factors of 50030?
1, 2, 5, 10, 5003, 10006, 25015, 50030.
What is 50030 in binary?
1100001101101110 (hexadecimal C36E, octal 141556).
What is the square root of 50030?
About 223.6739.
Is 50030 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 50030?
It is a composite number with 8 divisors.