The number 50490
50490 is a composite number with 64 divisors. Its prime factorisation is 2 × × 5 × 11 × 17. Divisors (64): 1, 2, 3, 5, 6, 9, 10, 11, 15, 17, 18, 22, 27, 30, 33, 34 … 50490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50490: a Harshad number: divisible by its digit sum 18.
- 2
50490 is composite. Its prime factorisation is
- 3
The divisors add up to 155520; without 50490 itself that is 105030, so 50490 is abundant (105030 is more than 50490). Euler's totient φ(50490) = 11520 numbers up to 50490 share no factor with it.
- 4
The digits of 50490 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50490 = 2 \times 3^{3} \times 5 \times 11 \times 17 \]50490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 64 |
| Sum of divisors | 155520 |
| Euler totient φ(n) | 11520 |
| Square | 2549240100 |
| Cube | 128711132649000 |
| Square root | 224.699800 (= 3√5610) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.049 × |
50490 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and ninety |
| Binary (base 2) | 1100010100111010 |
| Octal (base 8) | 142472 |
| Hexadecimal (base 16) | C53A |
| Base 3 | 2120021000 |
| As time | 50490 seconds = 14 h 1 min 30 s |
Is 50490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50490 ÷ 2 = 25245) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50490 ÷ 3 = 16830) | 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 (50490 ÷ 5 = 10098) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50490 ÷ 6 = 8415) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (50490 ÷ 9 = 5610) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50490 ÷ 10 = 5049) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50490 ÷ 11 = 4590) | 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 50490 a prime number?
No. 50490 = 2 × × 5 × 11 × 17, so it is divisible by 2.
What are the factors of 50490?
1, 2, 3, 5, 6, 9, 10, 11, 15, 17, 18, 22, 27, 30, 33, 34, 45, 51, 54, 55, 66, 85, 90, 99, 102, 110, 135, 153, 165, 170, 187, 198, 255, 270, 297, 306, 330, 374, 459, 495, 510, 561, 594, 765, 918, 935, 990, 1122, 1485, 1530, 1683, 1870, 2295, 2805, 2970, 3366, 4590, 5049, 5610, 8415, 10098, 16830, 25245, 50490.
What is 50490 in binary?
1100010100111010 (hexadecimal C53A, octal 142472).
What is the square root of 50490?
About 224.6998, exactly 3√5610.
Is 50490 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50490?
50490 is a Harshad number: divisible by its digit sum 18.