The number 50130
50130 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 557. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 557, 1114, 1671, 2785 … 50130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50130: a Harshad number: divisible by its digit sum 9.
- 2
50130 is composite. Its prime factorisation is
- 3
The divisors add up to 130572; without 50130 itself that is 80442, so 50130 is abundant (80442 is more than 50130). Euler's totient φ(50130) = 13344 numbers up to 50130 share no factor with it.
- 4
The digits of 50130 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50130 = 2 \times 3^{2} \times 5 \times 557 \]50130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 130572 |
| Euler totient φ(n) | 13344 |
| Square | 2513016900 |
| Cube | 125977537197000 |
| Square root | 223.897298 (= 3√5570) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.013 × |
50130 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and thirty |
| Binary (base 2) | 1100001111010010 |
| Octal (base 8) | 141722 |
| Hexadecimal (base 16) | C3D2 |
| Base 3 | 2112202200 |
| As time | 50130 seconds = 13 h 55 min 30 s |
Is 50130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50130 ÷ 2 = 25065) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50130 ÷ 3 = 16710) | 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 (50130 ÷ 5 = 10026) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50130 ÷ 6 = 8355) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50130 ÷ 9 = 5570) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50130 ÷ 10 = 5013) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 50130 a prime number?
No. 50130 = 2 × × 5 × 557, so it is divisible by 2.
What are the factors of 50130?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 557, 1114, 1671, 2785, 3342, 5013, 5570, 8355, 10026, 16710, 25065, 50130.
What is 50130 in binary?
1100001111010010 (hexadecimal C3D2, octal 141722).
What is the square root of 50130?
About 223.8973, exactly 3√5570.
Is 50130 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 50130?
50130 is a Harshad number: divisible by its digit sum 9.