The number 56068
56068 is a composite number with 12 divisors. Its prime factorisation is × 107 × 131. Divisors (12): 1, 2, 4, 107, 131, 214, 262, 428, 524, 14017, 28034, 56068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56068 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56068 is composite. Its prime factorisation is
- 3
The divisors add up to 99792; without 56068 itself that is 43724, so 56068 is deficient (43724 is less than 56068). Euler's totient φ(56068) = 27560 numbers up to 56068 share no factor with it.
- 4
The digits of 56068 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56068 = 2^{2} \times 107 \times 131 \]56068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 99792 |
| Euler totient φ(n) | 27560 |
| Square | 3143620624 |
| Cube | 176256521146432 |
| Square root | 236.786824 (= 2√14017) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.6068 × |
56068 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and sixty-eight |
| Binary (base 2) | 1101101100000100 |
| Octal (base 8) | 155404 |
| Hexadecimal (base 16) | DB04 |
| Base 3 | 2211220121 |
| As time | 56068 seconds = 15 h 34 min 28 s |
Is 56068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56068 ÷ 2 = 28034) | 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 (56068 ÷ 4 = 14017) | 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 4) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 1) | 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 56068 a prime number?
No. 56068 = × 107 × 131, so it is divisible by 2.
What are the factors of 56068?
1, 2, 4, 107, 131, 214, 262, 428, 524, 14017, 28034, 56068.
What is 56068 in binary?
1101101100000100 (hexadecimal DB04, octal 155404).
What is the square root of 56068?
About 236.7868, exactly 2√14017.
Is 56068 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 56068?
It is a composite number with 12 divisors.