The number 56942
56942 is a composite number with 8 divisors. Its prime factorisation is 2 × 71 × 401. Divisors (8): 1, 2, 71, 142, 401, 802, 28471, 56942.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56942 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56942 is composite. Its prime factorisation is
- 3
The divisors add up to 86832; without 56942 itself that is 29890, so 56942 is deficient (29890 is less than 56942). Euler's totient φ(56942) = 28000 numbers up to 56942 share no factor with it.
- 4
The digits of 56942 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56942 = 2 \times 71 \times 401 \]
56942 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 86832 |
| Euler totient φ(n) | 28000 |
| Square | 3242391364 |
| Cube | 184628249048888 |
| Square root | 238.625229 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.6942 × |
56942 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and forty-two |
| Binary (base 2) | 1101111001101110 |
| Octal (base 8) | 157156 |
| Hexadecimal (base 16) | DE6E |
| Base 3 | 2220002222 |
| As time | 56942 seconds = 15 h 49 min 2 s |
Is 56942 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56942 ÷ 2 = 28471) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56942 a prime number?
No. 56942 = 2 × 71 × 401, so it is divisible by 2.
What are the factors of 56942?
1, 2, 71, 142, 401, 802, 28471, 56942.
What is 56942 in binary?
1101111001101110 (hexadecimal DE6E, octal 157156).
What is the square root of 56942?
About 238.6252.
Is 56942 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 56942?
It is a composite number with 8 divisors.