The number 56192
56192 is a composite number with 16 divisors. Its prime factorisation is × 439. Divisors (16): 1, 2, 4, 8, 16, 32, 64, 128, 439, 878, 1756, 3512, 7024, 14048, 28096, 56192.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56192 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56192 is composite. Its prime factorisation is
- 3
The divisors add up to 112200; without 56192 itself that is 56008, so 56192 is deficient (56008 is less than 56192). Euler's totient φ(56192) = 28032 numbers up to 56192 share no factor with it.
- 4
The digits of 56192 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56192 = 2^{7} \times 439 \]56192 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 112200 |
| Euler totient φ(n) | 28032 |
| Square | 3157540864 |
| Cube | 177428536229888 |
| Square root | 237.048518 (= 8√878) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6192 × |
56192 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand one hundred and ninety-two |
| Binary (base 2) | 1101101110000000 |
| Octal (base 8) | 155600 |
| Hexadecimal (base 16) | DB80 |
| Base 3 | 2212002012 |
| As time | 56192 seconds = 15 h 36 min 32 s |
Is 56192 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56192 ÷ 2 = 28096) | 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 | Yes (56192 ÷ 4 = 14048) | 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 3) | 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 (56192 ÷ 8 = 7024) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56192 a prime number?
No. 56192 = × 439, so it is divisible by 2.
What are the factors of 56192?
1, 2, 4, 8, 16, 32, 64, 128, 439, 878, 1756, 3512, 7024, 14048, 28096, 56192.
What is 56192 in binary?
1101101110000000 (hexadecimal DB80, octal 155600).
What is the square root of 56192?
About 237.0485, exactly 8√878.
Is 56192 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 56192?
It is a composite number with 16 divisors.