The number 55046
55046 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 1619. Divisors (8): 1, 2, 17, 34, 1619, 3238, 27523, 55046.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55046 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55046 is composite. Its prime factorisation is
- 3
The divisors add up to 87480; without 55046 itself that is 32434, so 55046 is deficient (32434 is less than 55046). Euler's totient φ(55046) = 25888 numbers up to 55046 share no factor with it.
- 4
The digits of 55046 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
\[ 55046 = 2 \times 17 \times 1619 \]
55046 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 87480 |
| Euler totient φ(n) | 25888 |
| Square | 3030062116 |
| Cube | 166792799237336 |
| Square root | 234.618840 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5046 × |
55046 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and forty-six |
| Binary (base 2) | 1101011100000110 |
| Octal (base 8) | 153406 |
| Hexadecimal (base 16) | D706 |
| Base 3 | 2210111202 |
| As time | 55046 seconds = 15 h 17 min 26 s |
Is 55046 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55046 ÷ 2 = 27523) | 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 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 | No (remainder 2) | 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 6) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55046 a prime number?
No. 55046 = 2 × 17 × 1619, so it is divisible by 2.
What are the factors of 55046?
1, 2, 17, 34, 1619, 3238, 27523, 55046.
What is 55046 in binary?
1101011100000110 (hexadecimal D706, octal 153406).
What is the square root of 55046?
About 234.6188.
Is 55046 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 55046?
It is a composite number with 8 divisors.