The number 55506
55506 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × 11 × . Divisors (24): 1, 2, 3, 6, 11, 22, 29, 33, 58, 66, 87, 174, 319, 638, 841, 957 … 55506.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55506 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55506 is composite. Its prime factorisation is
- 3
The divisors add up to 125424; without 55506 itself that is 69918, so 55506 is abundant (69918 is more than 55506). Euler's totient φ(55506) = 16240 numbers up to 55506 share no factor with it.
- 4
The digits of 55506 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55506 = 2 \times 3 \times 11 \times 29^{2} \]55506 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 125424 |
| Euler totient φ(n) | 16240 |
| Square | 3080916036 |
| Cube | 171009325494216 |
| Square root | 235.597114 (= 29√66) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.5506 × |
55506 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand five hundred and six |
| Binary (base 2) | 1101100011010010 |
| Octal (base 8) | 154322 |
| Hexadecimal (base 16) | D8D2 |
| Base 3 | 2211010210 |
| As time | 55506 seconds = 15 h 25 min 6 s |
Is 55506 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55506 ÷ 2 = 27753) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55506 ÷ 3 = 18502) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (55506 ÷ 6 = 9251) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55506 ÷ 11 = 5046) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55506 a prime number?
No. 55506 = 2 × 3 × 11 × , so it is divisible by 2.
What are the factors of 55506?
1, 2, 3, 6, 11, 22, 29, 33, 58, 66, 87, 174, 319, 638, 841, 957, 1682, 1914, 2523, 5046, 9251, 18502, 27753, 55506.
What is 55506 in binary?
1101100011010010 (hexadecimal D8D2, octal 154322).
What is the square root of 55506?
About 235.5971, exactly 29√66.
Is 55506 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 55506?
It is a composite number with 24 divisors.