The number 50928
50928 is a composite number with 20 divisors. Its prime factorisation is × 3 × 1061. Divisors (20): 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1061, 2122, 3183, 4244, 6366, 8488 … 50928.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50928: a Harshad number: divisible by its digit sum 24.
- 2
50928 is composite. Its prime factorisation is
- 3
The divisors add up to 131688; without 50928 itself that is 80760, so 50928 is abundant (80760 is more than 50928). Euler's totient φ(50928) = 16960 numbers up to 50928 share no factor with it.
- 4
The digits of 50928 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50928 = 2^{4} \times 3 \times 1061 \]50928 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 131688 |
| Euler totient φ(n) | 16960 |
| Square | 2593661184 |
| Cube | 132089976778752 |
| Square root | 225.672329 (= 4√3183) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0928 × |
50928 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and twenty-eight |
| Binary (base 2) | 1100011011110000 |
| Octal (base 8) | 143360 |
| Hexadecimal (base 16) | C6F0 |
| Base 3 | 2120212020 |
| As time | 50928 seconds = 14 h 8 min 48 s |
Is 50928 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50928 ÷ 2 = 25464) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50928 ÷ 3 = 16976) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50928 ÷ 4 = 12732) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50928 ÷ 6 = 8488) | 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 | Yes (50928 ÷ 8 = 6366) | 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 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50928 ÷ 12 = 4244) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50928 a prime number?
No. 50928 = × 3 × 1061, so it is divisible by 2.
What are the factors of 50928?
1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1061, 2122, 3183, 4244, 6366, 8488, 12732, 16976, 25464, 50928.
What is 50928 in binary?
1100011011110000 (hexadecimal C6F0, octal 143360).
What is the square root of 50928?
About 225.6723, exactly 4√3183.
Is 50928 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 50928?
50928 is a Harshad number: divisible by its digit sum 24.