The number 55532
55532 is a composite number with 6 divisors. Its prime factorisation is × 13883. Divisors (6): 1, 2, 4, 13883, 27766, 55532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55532 is composite. Its prime factorisation is
- 3
The divisors add up to 97188; without 55532 itself that is 41656, so 55532 is deficient (41656 is less than 55532). Euler's totient φ(55532) = 27764 numbers up to 55532 share no factor with it.
- 4
The digits of 55532 add up to 20, 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
\[ 55532 = 2^{2} \times 13883 \]55532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 97188 |
| Euler totient φ(n) | 27764 |
| Square | 3083803024 |
| Cube | 171249749528768 |
| Square root | 235.652286 (= 2√13883) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5532 × |
55532 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand five hundred and thirty-two |
| Binary (base 2) | 1101100011101100 |
| Octal (base 8) | 154354 |
| Hexadecimal (base 16) | D8EC |
| Base 3 | 2211011202 |
| As time | 55532 seconds = 15 h 25 min 32 s |
Is 55532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55532 ÷ 2 = 27766) | 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 (55532 ÷ 4 = 13883) | 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 1) | 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 2) | 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 4) | 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 55532 a prime number?
No. 55532 = × 13883, so it is divisible by 2.
What are the factors of 55532?
1, 2, 4, 13883, 27766, 55532.
What is 55532 in binary?
1101100011101100 (hexadecimal D8EC, octal 154354).
What is the square root of 55532?
About 235.6523, exactly 2√13883.
Is 55532 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 55532?
It is a composite number with 6 divisors.