The number 56022
56022 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 9337. Divisors (8): 1, 2, 3, 6, 9337, 18674, 28011, 56022.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56022 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56022 is composite. Its prime factorisation is
- 3
The divisors add up to 112056; without 56022 itself that is 56034, so 56022 is abundant (56034 is more than 56022). Euler's totient φ(56022) = 18672 numbers up to 56022 share no factor with it.
- 4
The digits of 56022 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56022 = 2 \times 3 \times 9337 \]
56022 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 112056 |
| Euler totient φ(n) | 18672 |
| Square | 3138464484 |
| Cube | 175823057322648 |
| Square root | 236.689670 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6022 × |
56022 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and twenty-two |
| Binary (base 2) | 1101101011010110 |
| Octal (base 8) | 155326 |
| Hexadecimal (base 16) | DAD6 |
| Base 3 | 2211211220 |
| As time | 56022 seconds = 15 h 33 min 42 s |
Is 56022 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56022 ÷ 2 = 28011) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56022 ÷ 3 = 18674) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (56022 ÷ 6 = 9337) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 56022 a prime number?
No. 56022 = 2 × 3 × 9337, so it is divisible by 2.
What are the factors of 56022?
1, 2, 3, 6, 9337, 18674, 28011, 56022.
What is 56022 in binary?
1101101011010110 (hexadecimal DAD6, octal 155326).
What is the square root of 56022?
About 236.6897.
Is 56022 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 56022?
It is a composite number with 8 divisors.