The number 56051
56051 is a composite number with 4 divisors. Its prime factorisation is 23 × 2437. Divisors (4): 1, 23, 2437, 56051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56051: a semiprime: 23 × 2437, the product of two primes.
- 2
56051 is composite. Its prime factorisation is
- 3
The divisors add up to 58512; without 56051 itself that is 2461, so 56051 is deficient (2461 is less than 56051). Euler's totient φ(56051) = 53592 numbers up to 56051 share no factor with it.
- 4
The digits of 56051 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56051 = 23 \times 2437 \]
56051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58512 |
| Euler totient φ(n) | 53592 |
| Square | 3141714601 |
| Cube | 176096245100651 |
| Square root | 236.750924 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.6051 × |
56051 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and fifty-one |
| Binary (base 2) | 1101101011110011 |
| Octal (base 8) | 155363 |
| Hexadecimal (base 16) | DAF3 |
| Base 3 | 2211212222 |
| As time | 56051 seconds = 15 h 34 min 11 s |
Is 56051 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 1) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56051 a prime number?
No. 56051 = 23 × 2437, so it is divisible by 23.
What are the factors of 56051?
1, 23, 2437, 56051.
What is 56051 in binary?
1101101011110011 (hexadecimal DAF3, octal 155363).
What is the square root of 56051?
About 236.7509.
Is 56051 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 56051?
56051 is a semiprime: 23 × 2437, the product of two primes.