The number 56943
56943 is a composite number with 20 divisors. Its prime factorisation is × 19 × 37. Divisors (20): 1, 3, 9, 19, 27, 37, 57, 81, 111, 171, 333, 513, 703, 999, 1539, 2109 … 56943.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56943: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
56943 is composite. Its prime factorisation is
- 3
The divisors add up to 91960; without 56943 itself that is 35017, so 56943 is deficient (35017 is less than 56943). Euler's totient φ(56943) = 34992 numbers up to 56943 share no factor with it.
- 4
The digits of 56943 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 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56943 = 3^{4} \times 19 \times 37 \]56943 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 91960 |
| Euler totient φ(n) | 34992 |
| Square | 3242505249 |
| Cube | 184637976393807 |
| Square root | 238.627325 (= 9√703) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.6943 × |
56943 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and forty-three |
| Binary (base 2) | 1101111001101111 |
| Octal (base 8) | 157157 |
| Hexadecimal (base 16) | DE6F |
| Base 3 | 2220010000 |
| As time | 56943 seconds = 15 h 49 min 3 s |
Is 56943 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 (56943 ÷ 3 = 18981) | 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 3) | 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 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 | Yes (56943 ÷ 9 = 6327) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56943 a prime number?
No. 56943 = × 19 × 37, so it is divisible by 3.
What are the factors of 56943?
1, 3, 9, 19, 27, 37, 57, 81, 111, 171, 333, 513, 703, 999, 1539, 2109, 2997, 6327, 18981, 56943.
What is 56943 in binary?
1101111001101111 (hexadecimal DE6F, octal 157157).
What is the square root of 56943?
About 238.6273, exactly 9√703.
Is 56943 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56943?
56943 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.