The number 56047
56047 is a composite number with 4 divisors. Its prime factorisation is 41 × 1367. Divisors (4): 1, 41, 1367, 56047.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56047: a semiprime: 41 × 1367, the product of two primes.
- 2
56047 is composite. Its prime factorisation is
- 3
The divisors add up to 57456; without 56047 itself that is 1409, so 56047 is deficient (1409 is less than 56047). Euler's totient φ(56047) = 54640 numbers up to 56047 share no factor with it.
- 4
The digits of 56047 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56047 = 41 \times 1367 \]
56047 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57456 |
| Euler totient φ(n) | 54640 |
| Square | 3141266209 |
| Cube | 176058547215823 |
| Square root | 236.742476 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6047 × |
56047 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and forty-seven |
| Binary (base 2) | 1101101011101111 |
| Octal (base 8) | 155357 |
| Hexadecimal (base 16) | DAEF |
| Base 3 | 2211212211 |
| As time | 56047 seconds = 15 h 34 min 7 s |
Is 56047 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | 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 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56047 a prime number?
No. 56047 = 41 × 1367, so it is divisible by 41.
What are the factors of 56047?
1, 41, 1367, 56047.
What is 56047 in binary?
1101101011101111 (hexadecimal DAEF, octal 155357).
What is the square root of 56047?
About 236.7425.
Is 56047 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 56047?
56047 is a semiprime: 41 × 1367, the product of two primes.