The number 56968
56968 is a composite number with 8 divisors. Its prime factorisation is × 7121. Divisors (8): 1, 2, 4, 8, 7121, 14242, 28484, 56968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56968 is composite. Its prime factorisation is
- 3
The divisors add up to 106830; without 56968 itself that is 49862, so 56968 is deficient (49862 is less than 56968). Euler's totient φ(56968) = 28480 numbers up to 56968 share no factor with it.
- 4
The digits of 56968 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56968 = 2^{3} \times 7121 \]56968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 106830 |
| Euler totient φ(n) | 28480 |
| Square | 3245353024 |
| Cube | 184881271071232 |
| Square root | 238.679702 (= 2√14242) |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.6968 × |
56968 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and sixty-eight |
| Binary (base 2) | 1101111010001000 |
| Octal (base 8) | 157210 |
| Hexadecimal (base 16) | DE88 |
| Base 3 | 2220010221 |
| As time | 56968 seconds = 15 h 49 min 28 s |
Is 56968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56968 ÷ 2 = 28484) | 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 (56968 ÷ 4 = 14242) | 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 2) | 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 (56968 ÷ 8 = 7121) | 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 10) | 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 56968 a prime number?
No. 56968 = × 7121, so it is divisible by 2.
What are the factors of 56968?
1, 2, 4, 8, 7121, 14242, 28484, 56968.
What is 56968 in binary?
1101111010001000 (hexadecimal DE88, octal 157210).
What is the square root of 56968?
About 238.6797, exactly 2√14242.
Is 56968 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 56968?
It is a composite number with 8 divisors.