The number 53056
53056 is a composite number with 14 divisors. Its prime factorisation is × 829. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 829, 1658, 3316, 6632, 13264, 26528, 53056.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53056 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53056 is composite. Its prime factorisation is
- 3
The divisors add up to 105410; without 53056 itself that is 52354, so 53056 is deficient (52354 is less than 53056). Euler's totient φ(53056) = 26496 numbers up to 53056 share no factor with it.
- 4
The digits of 53056 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53056 = 2^{6} \times 829 \]53056 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 105410 |
| Euler totient φ(n) | 26496 |
| Square | 2814939136 |
| Cube | 149349410799616 |
| Square root | 230.338881 (= 8√829) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3056 × |
53056 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and fifty-six |
| Binary (base 2) | 1100111101000000 |
| Octal (base 8) | 147500 |
| Hexadecimal (base 16) | CF40 |
| Base 3 | 2200210001 |
| As time | 53056 seconds = 14 h 44 min 16 s |
Is 53056 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53056 ÷ 2 = 26528) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (53056 ÷ 4 = 13264) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 (53056 ÷ 8 = 6632) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53056 a prime number?
No. 53056 = × 829, so it is divisible by 2.
What are the factors of 53056?
1, 2, 4, 8, 16, 32, 64, 829, 1658, 3316, 6632, 13264, 26528, 53056.
What is 53056 in binary?
1100111101000000 (hexadecimal CF40, octal 147500).
What is the square root of 53056?
About 230.3389, exactly 8√829.
Is 53056 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 53056?
It is a composite number with 14 divisors.