The number 50910
50910 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1697. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1697, 3394, 5091, 8485, 10182, 16970, 25455, 50910.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50910: a Harshad number: divisible by its digit sum 15.
- 2
50910 is composite. Its prime factorisation is
- 3
The divisors add up to 122256; without 50910 itself that is 71346, so 50910 is abundant (71346 is more than 50910). Euler's totient φ(50910) = 13568 numbers up to 50910 share no factor with it.
- 4
The digits of 50910 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50910 = 2 \times 3 \times 5 \times 1697 \]
50910 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 122256 |
| Euler totient φ(n) | 13568 |
| Square | 2591828100 |
| Cube | 131949968571000 |
| Square root | 225.632444 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.091 × |
50910 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and ten |
| Binary (base 2) | 1100011011011110 |
| Octal (base 8) | 143336 |
| Hexadecimal (base 16) | C6DE |
| Base 3 | 2120211120 |
| As time | 50910 seconds = 14 h 8 min 30 s |
Is 50910 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50910 ÷ 2 = 25455) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50910 ÷ 3 = 16970) | 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 (50910 ÷ 5 = 10182) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50910 ÷ 6 = 8485) | 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 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 (50910 ÷ 10 = 5091) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50910 a prime number?
No. 50910 = 2 × 3 × 5 × 1697, so it is divisible by 2.
What are the factors of 50910?
1, 2, 3, 5, 6, 10, 15, 30, 1697, 3394, 5091, 8485, 10182, 16970, 25455, 50910.
What is 50910 in binary?
1100011011011110 (hexadecimal C6DE, octal 143336).
What is the square root of 50910?
About 225.6324.
Is 50910 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50910?
50910 is a Harshad number: divisible by its digit sum 15.