The number 55952
55952 is a composite number with 20 divisors. Its prime factorisation is × 13 × 269. Divisors (20): 1, 2, 4, 8, 13, 16, 26, 52, 104, 208, 269, 538, 1076, 2152, 3497, 4304 … 55952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55952: a Harshad number: divisible by its digit sum 26.
- 2
55952 is composite. Its prime factorisation is
- 3
The divisors add up to 117180; without 55952 itself that is 61228, so 55952 is abundant (61228 is more than 55952). Euler's totient φ(55952) = 25728 numbers up to 55952 share no factor with it.
- 4
The digits of 55952 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55952 = 2^{4} \times 13 \times 269 \]55952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 117180 |
| Euler totient φ(n) | 25728 |
| Square | 3130626304 |
| Cube | 175164802961408 |
| Square root | 236.541751 (= 4√3497) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5952 × |
55952 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and fifty-two |
| Binary (base 2) | 1101101010010000 |
| Octal (base 8) | 155220 |
| Hexadecimal (base 16) | DA90 |
| Base 3 | 2211202022 |
| As time | 55952 seconds = 15 h 32 min 32 s |
Is 55952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55952 ÷ 2 = 27976) | 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 (55952 ÷ 4 = 13988) | 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 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 | Yes (55952 ÷ 8 = 6994) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 6) | 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 55952 a prime number?
No. 55952 = × 13 × 269, so it is divisible by 2.
What are the factors of 55952?
1, 2, 4, 8, 13, 16, 26, 52, 104, 208, 269, 538, 1076, 2152, 3497, 4304, 6994, 13988, 27976, 55952.
What is 55952 in binary?
1101101010010000 (hexadecimal DA90, octal 155220).
What is the square root of 55952?
About 236.5418, exactly 4√3497.
Is 55952 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 55952?
55952 is a Harshad number: divisible by its digit sum 26.