The number 56781
56781 is a composite number with 10 divisors. Its prime factorisation is × 701. Divisors (10): 1, 3, 9, 27, 81, 701, 2103, 6309, 18927, 56781.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56781: a Harshad number: divisible by its digit sum 27.
- 2
56781 is composite. Its prime factorisation is
- 3
The divisors add up to 84942; without 56781 itself that is 28161, so 56781 is deficient (28161 is less than 56781). Euler's totient φ(56781) = 37800 numbers up to 56781 share no factor with it.
- 4
The digits of 56781 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56781 = 3^{4} \times 701 \]56781 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 84942 |
| Euler totient φ(n) | 37800 |
| Square | 3224081961 |
| Cube | 183066597827541 |
| Square root | 238.287641 (= 9√701) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6781 × |
56781 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand seven hundred and eighty-one |
| Binary (base 2) | 1101110111001101 |
| Octal (base 8) | 156715 |
| Hexadecimal (base 16) | DDCD |
| Base 3 | 2212220000 |
| As time | 56781 seconds = 15 h 46 min 21 s |
Is 56781 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 | Yes (56781 ÷ 3 = 18927) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (56781 ÷ 9 = 6309) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56781 a prime number?
No. 56781 = × 701, so it is divisible by 3.
What are the factors of 56781?
1, 3, 9, 27, 81, 701, 2103, 6309, 18927, 56781.
What is 56781 in binary?
1101110111001101 (hexadecimal DDCD, octal 156715).
What is the square root of 56781?
About 238.2876, exactly 9√701.
Is 56781 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56781?
56781 is a Harshad number: divisible by its digit sum 27.