The number 56851
56851 is a composite number with 4 divisors. Its prime factorisation is 139 × 409. Divisors (4): 1, 139, 409, 56851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56851: a semiprime: 139 × 409, the product of two primes.
- 2
56851 is composite. Its prime factorisation is
- 3
The divisors add up to 57400; without 56851 itself that is 549, so 56851 is deficient (549 is less than 56851). Euler's totient φ(56851) = 56304 numbers up to 56851 share no factor with it.
- 4
The digits of 56851 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56851 = 139 \times 409 \]
56851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57400 |
| Euler totient φ(n) | 56304 |
| Square | 3232036201 |
| Cube | 183744490063051 |
| Square root | 238.434477 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.6851 × |
56851 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand eight hundred and fifty-one |
| Binary (base 2) | 1101111000010011 |
| Octal (base 8) | 157023 |
| Hexadecimal (base 16) | DE13 |
| Base 3 | 2212222121 |
| As time | 56851 seconds = 15 h 47 min 31 s |
Is 56851 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 1) | 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 4) | 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 7) | 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 3) | 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 56851 a prime number?
No. 56851 = 139 × 409, so it is divisible by 139.
What are the factors of 56851?
1, 139, 409, 56851.
What is 56851 in binary?
1101111000010011 (hexadecimal DE13, octal 157023).
What is the square root of 56851?
About 238.4345.
Is 56851 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 56851?
56851 is a semiprime: 139 × 409, the product of two primes.