The number 50048
50048 is a composite number with 32 divisors. Its prime factorisation is × 17 × 23. Divisors (32): 1, 2, 4, 8, 16, 17, 23, 32, 34, 46, 64, 68, 92, 128, 136, 184 … 50048.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50048: a Harshad number: divisible by its digit sum 17.
- 2
50048 is composite. Its prime factorisation is
- 3
The divisors add up to 110160; without 50048 itself that is 60112, so 50048 is abundant (60112 is more than 50048). Euler's totient φ(50048) = 22528 numbers up to 50048 share no factor with it.
- 4
The digits of 50048 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50048 = 2^{7} \times 17 \times 23 \]50048 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 110160 |
| Euler totient φ(n) | 22528 |
| Square | 2504802304 |
| Cube | 125360345710592 |
| Square root | 223.714103 (= 8√782) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0048 × |
50048 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and forty-eight |
| Binary (base 2) | 1100001110000000 |
| Octal (base 8) | 141600 |
| Hexadecimal (base 16) | C380 |
| Base 3 | 2112122122 |
| As time | 50048 seconds = 13 h 54 min 8 s |
Is 50048 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50048 ÷ 2 = 25024) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50048 ÷ 4 = 12512) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (50048 ÷ 8 = 6256) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50048 a prime number?
No. 50048 = × 17 × 23, so it is divisible by 2.
What are the factors of 50048?
1, 2, 4, 8, 16, 17, 23, 32, 34, 46, 64, 68, 92, 128, 136, 184, 272, 368, 391, 544, 736, 782, 1088, 1472, 1564, 2176, 2944, 3128, 6256, 12512, 25024, 50048.
What is 50048 in binary?
1100001110000000 (hexadecimal C380, octal 141600).
What is the square root of 50048?
About 223.7141, exactly 8√782.
Is 50048 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50048?
50048 is a Harshad number: divisible by its digit sum 17.