The number 56048
56048 is a composite number with 20 divisors. Its prime factorisation is × 31 × 113. Divisors (20): 1, 2, 4, 8, 16, 31, 62, 113, 124, 226, 248, 452, 496, 904, 1808, 3503 … 56048.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56048 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56048 is composite. Its prime factorisation is
- 3
The divisors add up to 113088; without 56048 itself that is 57040, so 56048 is abundant (57040 is more than 56048). Euler's totient φ(56048) = 26880 numbers up to 56048 share no factor with it.
- 4
The digits of 56048 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56048 = 2^{4} \times 31 \times 113 \]56048 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 113088 |
| Euler totient φ(n) | 26880 |
| Square | 3141378304 |
| Cube | 176067971182592 |
| Square root | 236.744588 (= 4√3503) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6048 × |
56048 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and forty-eight |
| Binary (base 2) | 1101101011110000 |
| Octal (base 8) | 155360 |
| Hexadecimal (base 16) | DAF0 |
| Base 3 | 2211212212 |
| As time | 56048 seconds = 15 h 34 min 8 s |
Is 56048 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56048 ÷ 2 = 28024) | 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 (56048 ÷ 4 = 14012) | 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 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 | Yes (56048 ÷ 8 = 7006) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 3) | 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 56048 a prime number?
No. 56048 = × 31 × 113, so it is divisible by 2.
What are the factors of 56048?
1, 2, 4, 8, 16, 31, 62, 113, 124, 226, 248, 452, 496, 904, 1808, 3503, 7006, 14012, 28024, 56048.
What is 56048 in binary?
1101101011110000 (hexadecimal DAF0, octal 155360).
What is the square root of 56048?
About 236.7446, exactly 4√3503.
Is 56048 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 56048?
It is a composite number with 20 divisors.