The number 55047
55047 is a composite number with 8 divisors. Its prime factorisation is 3 × 59 × 311. Divisors (8): 1, 3, 59, 177, 311, 933, 18349, 55047.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55047 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55047 is composite. Its prime factorisation is
- 3
The divisors add up to 74880; without 55047 itself that is 19833, so 55047 is deficient (19833 is less than 55047). Euler's totient φ(55047) = 35960 numbers up to 55047 share no factor with it.
- 4
The digits of 55047 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
\[ 55047 = 3 \times 59 \times 311 \]
55047 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74880 |
| Euler totient φ(n) | 35960 |
| Square | 3030172209 |
| Cube | 166801889588823 |
| Square root | 234.620971 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5047 × |
55047 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and forty-seven |
| Binary (base 2) | 1101011100000111 |
| Octal (base 8) | 153407 |
| Hexadecimal (base 16) | D707 |
| Base 3 | 2210111210 |
| As time | 55047 seconds = 15 h 17 min 27 s |
Is 55047 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 (55047 ÷ 3 = 18349) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | 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 7) | 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 7) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55047 a prime number?
No. 55047 = 3 × 59 × 311, so it is divisible by 3.
What are the factors of 55047?
1, 3, 59, 177, 311, 933, 18349, 55047.
What is 55047 in binary?
1101011100000111 (hexadecimal D707, octal 153407).
What is the square root of 55047?
About 234.6210.
Is 55047 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 55047?
It is a composite number with 8 divisors.