The number 56036
56036 is a composite number with 6 divisors. Its prime factorisation is × 14009. Divisors (6): 1, 2, 4, 14009, 28018, 56036.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56036 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56036 is composite. Its prime factorisation is
- 3
The divisors add up to 98070; without 56036 itself that is 42034, so 56036 is deficient (42034 is less than 56036). Euler's totient φ(56036) = 28016 numbers up to 56036 share no factor with it.
- 4
The digits of 56036 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56036 = 2^{2} \times 14009 \]56036 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 98070 |
| Euler totient φ(n) | 28016 |
| Square | 3140033296 |
| Cube | 175954905774656 |
| Square root | 236.719243 (= 2√14009) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.6036 × |
56036 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and thirty-six |
| Binary (base 2) | 1101101011100100 |
| Octal (base 8) | 155344 |
| Hexadecimal (base 16) | DAE4 |
| Base 3 | 2211212102 |
| As time | 56036 seconds = 15 h 33 min 56 s |
Is 56036 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56036 ÷ 2 = 28018) | 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 (56036 ÷ 4 = 14009) | 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 2) | 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 2) | 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 2) | 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 56036 a prime number?
No. 56036 = × 14009, so it is divisible by 2.
What are the factors of 56036?
1, 2, 4, 14009, 28018, 56036.
What is 56036 in binary?
1101101011100100 (hexadecimal DAE4, octal 155344).
What is the square root of 56036?
About 236.7192, exactly 2√14009.
Is 56036 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 56036?
It is a composite number with 6 divisors.