The number 56738
56738 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 2579. Divisors (8): 1, 2, 11, 22, 2579, 5158, 28369, 56738.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56738 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56738 is composite. Its prime factorisation is
- 3
The divisors add up to 92880; without 56738 itself that is 36142, so 56738 is deficient (36142 is less than 56738). Euler's totient φ(56738) = 25780 numbers up to 56738 share no factor with it.
- 4
The digits of 56738 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56738 = 2 \times 11 \times 2579 \]
56738 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 92880 |
| Euler totient φ(n) | 25780 |
| Square | 3219200644 |
| Cube | 182651006139272 |
| Square root | 238.197397 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6738 × |
56738 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand seven hundred and thirty-eight |
| Binary (base 2) | 1101110110100010 |
| Octal (base 8) | 156642 |
| Hexadecimal (base 16) | DDA2 |
| Base 3 | 2212211102 |
| As time | 56738 seconds = 15 h 45 min 38 s |
Is 56738 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56738 ÷ 2 = 28369) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56738 ÷ 11 = 5158) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56738 a prime number?
No. 56738 = 2 × 11 × 2579, so it is divisible by 2.
What are the factors of 56738?
1, 2, 11, 22, 2579, 5158, 28369, 56738.
What is 56738 in binary?
1101110110100010 (hexadecimal DDA2, octal 156642).
What is the square root of 56738?
About 238.1974.
Is 56738 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 56738?
It is a composite number with 8 divisors.