The number 55928
55928 is a composite number with 8 divisors. Its prime factorisation is × 6991. Divisors (8): 1, 2, 4, 8, 6991, 13982, 27964, 55928.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55928 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55928 is composite. Its prime factorisation is
- 3
The divisors add up to 104880; without 55928 itself that is 48952, so 55928 is deficient (48952 is less than 55928). Euler's totient φ(55928) = 27960 numbers up to 55928 share no factor with it.
- 4
The digits of 55928 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55928 = 2^{3} \times 6991 \]55928 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 104880 |
| Euler totient φ(n) | 27960 |
| Square | 3127941184 |
| Cube | 174939494538752 |
| Square root | 236.491015 (= 2√13982) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5928 × |
55928 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and twenty-eight |
| Binary (base 2) | 1101101001111000 |
| Octal (base 8) | 155170 |
| Hexadecimal (base 16) | DA78 |
| Base 3 | 2211201102 |
| As time | 55928 seconds = 15 h 32 min 8 s |
Is 55928 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55928 ÷ 2 = 27964) | 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 (55928 ÷ 4 = 13982) | 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 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 | Yes (55928 ÷ 8 = 6991) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 55928 a prime number?
No. 55928 = × 6991, so it is divisible by 2.
What are the factors of 55928?
1, 2, 4, 8, 6991, 13982, 27964, 55928.
What is 55928 in binary?
1101101001111000 (hexadecimal DA78, octal 155170).
What is the square root of 55928?
About 236.4910, exactly 2√13982.
Is 55928 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 55928?
It is a composite number with 8 divisors.