The number 50190
50190 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 7 × 239. Divisors (32): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210 … 50190.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50190: a Harshad number: divisible by its digit sum 15.
- 2
50190 is composite. Its prime factorisation is
- 3
The divisors add up to 138240; without 50190 itself that is 88050, so 50190 is abundant (88050 is more than 50190). Euler's totient φ(50190) = 11424 numbers up to 50190 share no factor with it.
- 4
The digits of 50190 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50190 = 2 \times 3 \times 5 \times 7 \times 239 \]
50190 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 138240 |
| Euler totient φ(n) | 11424 |
| Square | 2519036100 |
| Cube | 126430421859000 |
| Square root | 224.031248 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.019 × |
50190 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and ninety |
| Binary (base 2) | 1100010000001110 |
| Octal (base 8) | 142016 |
| Hexadecimal (base 16) | C40E |
| Base 3 | 2112211220 |
| As time | 50190 seconds = 13 h 56 min 30 s |
Is 50190 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50190 ÷ 2 = 25095) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50190 ÷ 3 = 16730) | 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 (50190 ÷ 5 = 10038) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50190 ÷ 6 = 8365) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50190 ÷ 7 = 7170) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50190 ÷ 10 = 5019) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 50190 a prime number?
No. 50190 = 2 × 3 × 5 × 7 × 239, so it is divisible by 2.
What are the factors of 50190?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210, 239, 478, 717, 1195, 1434, 1673, 2390, 3346, 3585, 5019, 7170, 8365, 10038, 16730, 25095, 50190.
What is 50190 in binary?
1100010000001110 (hexadecimal C40E, octal 142016).
What is the square root of 50190?
About 224.0312.
Is 50190 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50190?
50190 is a Harshad number: divisible by its digit sum 15.