The number 55932
55932 is a composite number with 24 divisors. Its prime factorisation is × 3 × 59 × 79. Divisors (24): 1, 2, 3, 4, 6, 12, 59, 79, 118, 158, 177, 236, 237, 316, 354, 474 … 55932.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55932 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55932 is composite. Its prime factorisation is
- 3
The divisors add up to 134400; without 55932 itself that is 78468, so 55932 is abundant (78468 is more than 55932). Euler's totient φ(55932) = 18096 numbers up to 55932 share no factor with it.
- 4
The digits of 55932 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55932 = 2^{2} \times 3 \times 59 \times 79 \]55932 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 134400 |
| Euler totient φ(n) | 18096 |
| Square | 3128388624 |
| Cube | 174977032517568 |
| Square root | 236.499471 (= 2√13983) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.5932 × |
55932 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and thirty-two |
| Binary (base 2) | 1101101001111100 |
| Octal (base 8) | 155174 |
| Hexadecimal (base 16) | DA7C |
| Base 3 | 2211201120 |
| As time | 55932 seconds = 15 h 32 min 12 s |
Is 55932 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55932 ÷ 2 = 27966) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55932 ÷ 3 = 18644) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (55932 ÷ 4 = 13983) | 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 | Yes (55932 ÷ 6 = 9322) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 | Yes (55932 ÷ 12 = 4661) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55932 a prime number?
No. 55932 = × 3 × 59 × 79, so it is divisible by 2.
What are the factors of 55932?
1, 2, 3, 4, 6, 12, 59, 79, 118, 158, 177, 236, 237, 316, 354, 474, 708, 948, 4661, 9322, 13983, 18644, 27966, 55932.
What is 55932 in binary?
1101101001111100 (hexadecimal DA7C, octal 155174).
What is the square root of 55932?
About 236.4995, exactly 2√13983.
Is 55932 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 55932?
It is a composite number with 24 divisors.