The number 55737
55737 is a composite number with 12 divisors. Its prime factorisation is × 11 × 563. Divisors (12): 1, 3, 9, 11, 33, 99, 563, 1689, 5067, 6193, 18579, 55737.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55737 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55737 is composite. Its prime factorisation is
- 3
The divisors add up to 87984; without 55737 itself that is 32247, so 55737 is deficient (32247 is less than 55737). Euler's totient φ(55737) = 33720 numbers up to 55737 share no factor with it.
- 4
The digits of 55737 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55737 = 3^{2} \times 11 \times 563 \]55737 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 87984 |
| Euler totient φ(n) | 33720 |
| Square | 3106613169 |
| Cube | 173153298200553 |
| Square root | 236.086848 (= 3√6193) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5737 × |
55737 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand seven hundred and thirty-seven |
| Binary (base 2) | 1101100110111001 |
| Octal (base 8) | 154671 |
| Hexadecimal (base 16) | D9B9 |
| Base 3 | 2211110100 |
| As time | 55737 seconds = 15 h 28 min 57 s |
Is 55737 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 (55737 ÷ 3 = 18579) | 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 2) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (55737 ÷ 9 = 6193) | 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 (55737 ÷ 11 = 5067) | 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 55737 a prime number?
No. 55737 = × 11 × 563, so it is divisible by 3.
What are the factors of 55737?
1, 3, 9, 11, 33, 99, 563, 1689, 5067, 6193, 18579, 55737.
What is 55737 in binary?
1101100110111001 (hexadecimal D9B9, octal 154671).
What is the square root of 55737?
About 236.0868, exactly 3√6193.
Is 55737 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 55737?
It is a composite number with 12 divisors.