The number 56092
56092 is a composite number with 12 divisors. Its prime factorisation is × 37 × 379. Divisors (12): 1, 2, 4, 37, 74, 148, 379, 758, 1516, 14023, 28046, 56092.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56092 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56092 is composite. Its prime factorisation is
- 3
The divisors add up to 101080; without 56092 itself that is 44988, so 56092 is deficient (44988 is less than 56092). Euler's totient φ(56092) = 27216 numbers up to 56092 share no factor with it.
- 4
The digits of 56092 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56092 = 2^{2} \times 37 \times 379 \]56092 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 101080 |
| Euler totient φ(n) | 27216 |
| Square | 3146312464 |
| Cube | 176482958730688 |
| Square root | 236.837497 (= 2√14023) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.6092 × |
56092 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and ninety-two |
| Binary (base 2) | 1101101100011100 |
| Octal (base 8) | 155434 |
| Hexadecimal (base 16) | DB1C |
| Base 3 | 2211221111 |
| As time | 56092 seconds = 15 h 34 min 52 s |
Is 56092 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56092 ÷ 2 = 28046) | 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 (56092 ÷ 4 = 14023) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 56092 a prime number?
No. 56092 = × 37 × 379, so it is divisible by 2.
What are the factors of 56092?
1, 2, 4, 37, 74, 148, 379, 758, 1516, 14023, 28046, 56092.
What is 56092 in binary?
1101101100011100 (hexadecimal DB1C, octal 155434).
What is the square root of 56092?
About 236.8375, exactly 2√14023.
Is 56092 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 56092?
It is a composite number with 12 divisors.