The number 56947
56947 is a composite number with 8 divisors. Its prime factorisation is 11 × 31 × 167. Divisors (8): 1, 11, 31, 167, 341, 1837, 5177, 56947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56947: a Harshad number: divisible by its digit sum 31.
- 2
56947 is composite. Its prime factorisation is
- 3
The divisors add up to 64512; without 56947 itself that is 7565, so 56947 is deficient (7565 is less than 56947). Euler's totient φ(56947) = 49800 numbers up to 56947 share no factor with it.
- 4
The digits of 56947 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56947 = 11 \times 31 \times 167 \]
56947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 64512 |
| Euler totient φ(n) | 49800 |
| Square | 3242960809 |
| Cube | 184676889190123 |
| Square root | 238.635706 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.6947 × |
56947 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and forty-seven |
| Binary (base 2) | 1101111001110011 |
| Octal (base 8) | 157163 |
| Hexadecimal (base 16) | DE73 |
| Base 3 | 2220010011 |
| As time | 56947 seconds = 15 h 49 min 7 s |
Is 56947 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 2) | 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 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56947 ÷ 11 = 5177) | 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 56947 a prime number?
No. 56947 = 11 × 31 × 167, so it is divisible by 11.
What are the factors of 56947?
1, 11, 31, 167, 341, 1837, 5177, 56947.
What is 56947 in binary?
1101111001110011 (hexadecimal DE73, octal 157163).
What is the square root of 56947?
About 238.6357.
Is 56947 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 56947?
56947 is a Harshad number: divisible by its digit sum 31.