The number 55649
55649 is a composite number with 4 divisors. Its prime factorisation is 11 × 5059. Divisors (4): 1, 11, 5059, 55649.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55649: a semiprime: 11 × 5059, the product of two primes.
- 2
55649 is composite. Its prime factorisation is
- 3
The divisors add up to 60720; without 55649 itself that is 5071, so 55649 is deficient (5071 is less than 55649). Euler's totient φ(55649) = 50580 numbers up to 55649 share no factor with it.
- 4
The digits of 55649 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55649 = 11 \times 5059 \]
55649 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60720 |
| Euler totient φ(n) | 50580 |
| Square | 3096811201 |
| Cube | 172334446524449 |
| Square root | 235.900403 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5649 × |
55649 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand six hundred and forty-nine |
| Binary (base 2) | 1101100101100001 |
| Octal (base 8) | 154541 |
| Hexadecimal (base 16) | D961 |
| Base 3 | 2211100002 |
| As time | 55649 seconds = 15 h 27 min 29 s |
Is 55649 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 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55649 ÷ 11 = 5059) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55649 a prime number?
No. 55649 = 11 × 5059, so it is divisible by 11.
What are the factors of 55649?
1, 11, 5059, 55649.
What is 55649 in binary?
1101100101100001 (hexadecimal D961, octal 154541).
What is the square root of 55649?
About 235.9004.
Is 55649 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 55649?
55649 is a semiprime: 11 × 5059, the product of two primes.