The number 56641
56641 is a composite number with 4 divisors. Its prime factorisation is 13 × 4357. Divisors (4): 1, 13, 4357, 56641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56641: a semiprime: 13 × 4357, the product of two primes.
- 2
56641 is composite. Its prime factorisation is
- 3
The divisors add up to 61012; without 56641 itself that is 4371, so 56641 is deficient (4371 is less than 56641). Euler's totient φ(56641) = 52272 numbers up to 56641 share no factor with it.
- 4
The digits of 56641 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56641 = 13 \times 4357 \]
56641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61012 |
| Euler totient φ(n) | 52272 |
| Square | 3208202881 |
| Cube | 181715819382721 |
| Square root | 237.993697 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6641 × |
56641 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand six hundred and forty-one |
| Binary (base 2) | 1101110101000001 |
| Octal (base 8) | 156501 |
| Hexadecimal (base 16) | DD41 |
| Base 3 | 2212200211 |
| As time | 56641 seconds = 15 h 44 min 1 s |
Is 56641 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 1) | 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 1) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56641 a prime number?
No. 56641 = 13 × 4357, so it is divisible by 13.
What are the factors of 56641?
1, 13, 4357, 56641.
What is 56641 in binary?
1101110101000001 (hexadecimal DD41, octal 156501).
What is the square root of 56641?
About 237.9937.
Is 56641 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 56641?
56641 is a semiprime: 13 × 4357, the product of two primes.