The number 55064
55064 is a composite number with 8 divisors. Its prime factorisation is × 6883. Divisors (8): 1, 2, 4, 8, 6883, 13766, 27532, 55064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55064 is composite. Its prime factorisation is
- 3
The divisors add up to 103260; without 55064 itself that is 48196, so 55064 is deficient (48196 is less than 55064). Euler's totient φ(55064) = 27528 numbers up to 55064 share no factor with it.
- 4
The digits of 55064 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55064 = 2^{3} \times 6883 \]55064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 103260 |
| Euler totient φ(n) | 27528 |
| Square | 3032044096 |
| Cube | 166956476102144 |
| Square root | 234.657197 (= 2√13766) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5064 × |
55064 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and sixty-four |
| Binary (base 2) | 1101011100011000 |
| Octal (base 8) | 153430 |
| Hexadecimal (base 16) | D718 |
| Base 3 | 2210112102 |
| As time | 55064 seconds = 15 h 17 min 44 s |
Is 55064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55064 ÷ 2 = 27532) | 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 (55064 ÷ 4 = 13766) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 2) | 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 | Yes (55064 ÷ 8 = 6883) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 55064 a prime number?
No. 55064 = × 6883, so it is divisible by 2.
What are the factors of 55064?
1, 2, 4, 8, 6883, 13766, 27532, 55064.
What is 55064 in binary?
1101011100011000 (hexadecimal D718, octal 153430).
What is the square root of 55064?
About 234.6572, exactly 2√13766.
Is 55064 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 55064?
It is a composite number with 8 divisors.