The number 55641
55641 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 1091. Divisors (8): 1, 3, 17, 51, 1091, 3273, 18547, 55641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55641: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55641 is composite. Its prime factorisation is
- 3
The divisors add up to 78624; without 55641 itself that is 22983, so 55641 is deficient (22983 is less than 55641). Euler's totient φ(55641) = 34880 numbers up to 55641 share no factor with it.
- 4
The digits of 55641 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55641 = 3 \times 17 \times 1091 \]
55641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78624 |
| Euler totient φ(n) | 34880 |
| Square | 3095920881 |
| Cube | 172260133739721 |
| Square root | 235.883446 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5641 × |
55641 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand six hundred and forty-one |
| Binary (base 2) | 1101100101011001 |
| Octal (base 8) | 154531 |
| Hexadecimal (base 16) | D959 |
| Base 3 | 2211022210 |
| As time | 55641 seconds = 15 h 27 min 21 s |
Is 55641 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 (55641 ÷ 3 = 18547) | 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 1) | 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 5) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 55641 a prime number?
No. 55641 = 3 × 17 × 1091, so it is divisible by 3.
What are the factors of 55641?
1, 3, 17, 51, 1091, 3273, 18547, 55641.
What is 55641 in binary?
1101100101011001 (hexadecimal D959, octal 154531).
What is the square root of 55641?
About 235.8834.
Is 55641 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 55641?
55641 is a happy number: repeatedly adding the squares of its digits reaches 1.