The number 56956
56956 is a composite number with 12 divisors. Its prime factorisation is × 29 × 491. Divisors (12): 1, 2, 4, 29, 58, 116, 491, 982, 1964, 14239, 28478, 56956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56956: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
56956 is composite. Its prime factorisation is
- 3
The divisors add up to 103320; without 56956 itself that is 46364, so 56956 is deficient (46364 is less than 56956). Euler's totient φ(56956) = 27440 numbers up to 56956 share no factor with it.
- 4
The digits of 56956 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56956 = 2^{2} \times 29 \times 491 \]56956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 103320 |
| Euler totient φ(n) | 27440 |
| Square | 3243985936 |
| Cube | 184764462970816 |
| Square root | 238.654562 (= 2√14239) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.6956 × |
56956 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and fifty-six |
| Binary (base 2) | 1101111001111100 |
| Octal (base 8) | 157174 |
| Hexadecimal (base 16) | DE7C |
| Base 3 | 2220010111 |
| As time | 56956 seconds = 15 h 49 min 16 s |
Is 56956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56956 ÷ 2 = 28478) | 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 (56956 ÷ 4 = 14239) | 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 4) | 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 4) | 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 9) | 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 56956 a prime number?
No. 56956 = × 29 × 491, so it is divisible by 2.
What are the factors of 56956?
1, 2, 4, 29, 58, 116, 491, 982, 1964, 14239, 28478, 56956.
What is 56956 in binary?
1101111001111100 (hexadecimal DE7C, octal 157174).
What is the square root of 56956?
About 238.6546, exactly 2√14239.
Is 56956 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 56956?
56956 is a happy number: repeatedly adding the squares of its digits reaches 1.