The number 55063
55063 is a composite number with 8 divisors. Its prime factorisation is 17 × 41 × 79. Divisors (8): 1, 17, 41, 79, 697, 1343, 3239, 55063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55063 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55063 is composite. Its prime factorisation is
- 3
The divisors add up to 60480; without 55063 itself that is 5417, so 55063 is deficient (5417 is less than 55063). Euler's totient φ(55063) = 49920 numbers up to 55063 share no factor with it.
- 4
The digits of 55063 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55063 = 17 \times 41 \times 79 \]
55063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 60480 |
| Euler totient φ(n) | 49920 |
| Square | 3031933969 |
| Cube | 166947380135047 |
| Square root | 234.655066 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.5063 × |
55063 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and sixty-three |
| Binary (base 2) | 1101011100010111 |
| Octal (base 8) | 153427 |
| Hexadecimal (base 16) | D717 |
| Base 3 | 2210112101 |
| As time | 55063 seconds = 15 h 17 min 43 s |
Is 55063 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 | No (remainder 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55063 a prime number?
No. 55063 = 17 × 41 × 79, so it is divisible by 17.
What are the factors of 55063?
1, 17, 41, 79, 697, 1343, 3239, 55063.
What is 55063 in binary?
1101011100010111 (hexadecimal D717, octal 153427).
What is the square root of 55063?
About 234.6551.
Is 55063 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 55063?
It is a composite number with 8 divisors.