The number 55364
55364 is a composite number with 6 divisors. Its prime factorisation is × 13841. Divisors (6): 1, 2, 4, 13841, 27682, 55364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55364 is composite. Its prime factorisation is
- 3
The divisors add up to 96894; without 55364 itself that is 41530, so 55364 is deficient (41530 is less than 55364). Euler's totient φ(55364) = 27680 numbers up to 55364 share no factor with it.
- 4
The digits of 55364 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55364 = 2^{2} \times 13841 \]55364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 96894 |
| Euler totient φ(n) | 27680 |
| Square | 3065172496 |
| Cube | 169700210068544 |
| Square root | 235.295559 (= 2√13841) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5364 × |
55364 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand three hundred and sixty-four |
| Binary (base 2) | 1101100001000100 |
| Octal (base 8) | 154104 |
| Hexadecimal (base 16) | D844 |
| Base 3 | 2210221112 |
| As time | 55364 seconds = 15 h 22 min 44 s |
Is 55364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55364 ÷ 2 = 27682) | 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 (55364 ÷ 4 = 13841) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 1) | 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 55364 a prime number?
No. 55364 = × 13841, so it is divisible by 2.
What are the factors of 55364?
1, 2, 4, 13841, 27682, 55364.
What is 55364 in binary?
1101100001000100 (hexadecimal D844, octal 154104).
What is the square root of 55364?
About 235.2956, exactly 2√13841.
Is 55364 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55364?
It is a composite number with 6 divisors.