The number 55382
55382 is a composite number with 4 divisors. Its prime factorisation is 2 × 27691. Divisors (4): 1, 2, 27691, 55382.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55382: a semiprime: 2 × 27691, the product of two primes.
- 2
55382 is composite. Its prime factorisation is
- 3
The divisors add up to 83076; without 55382 itself that is 27694, so 55382 is deficient (27694 is less than 55382). Euler's totient φ(55382) = 27690 numbers up to 55382 share no factor with it.
- 4
The digits of 55382 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55382 = 2 \times 27691 \]
55382 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 83076 |
| Euler totient φ(n) | 27690 |
| Square | 3067165924 |
| Cube | 169865783202968 |
| Square root | 235.333805 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5382 × |
55382 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand three hundred and eighty-two |
| Binary (base 2) | 1101100001010110 |
| Octal (base 8) | 154126 |
| Hexadecimal (base 16) | D856 |
| Base 3 | 2210222012 |
| As time | 55382 seconds = 15 h 23 min 2 s |
Is 55382 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55382 ÷ 2 = 27691) | 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 2) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55382 a prime number?
No. 55382 = 2 × 27691, so it is divisible by 2.
What are the factors of 55382?
1, 2, 27691, 55382.
What is 55382 in binary?
1101100001010110 (hexadecimal D856, octal 154126).
What is the square root of 55382?
About 235.3338.
Is 55382 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55382?
55382 is a semiprime: 2 × 27691, the product of two primes.