The number 56732
56732 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1091. Divisors (12): 1, 2, 4, 13, 26, 52, 1091, 2182, 4364, 14183, 28366, 56732.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56732 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56732 is composite. Its prime factorisation is
- 3
The divisors add up to 107016; without 56732 itself that is 50284, so 56732 is deficient (50284 is less than 56732). Euler's totient φ(56732) = 26160 numbers up to 56732 share no factor with it.
- 4
The digits of 56732 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56732 = 2^{2} \times 13 \times 1091 \]56732 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 107016 |
| Euler totient φ(n) | 26160 |
| Square | 3218519824 |
| Cube | 182593066655168 |
| Square root | 238.184802 (= 2√14183) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.6732 × |
56732 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand seven hundred and thirty-two |
| Binary (base 2) | 1101110110011100 |
| Octal (base 8) | 156634 |
| Hexadecimal (base 16) | DD9C |
| Base 3 | 2212211012 |
| As time | 56732 seconds = 15 h 45 min 32 s |
Is 56732 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56732 ÷ 2 = 28366) | 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 | Yes (56732 ÷ 4 = 14183) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56732 a prime number?
No. 56732 = × 13 × 1091, so it is divisible by 2.
What are the factors of 56732?
1, 2, 4, 13, 26, 52, 1091, 2182, 4364, 14183, 28366, 56732.
What is 56732 in binary?
1101110110011100 (hexadecimal DD9C, octal 156634).
What is the square root of 56732?
About 238.1848, exactly 2√14183.
Is 56732 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 56732?
It is a composite number with 12 divisors.