The number 20552
20552 is a composite number with 16 divisors. Its prime factorisation is × 7 × 367. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 367, 734, 1468, 2569, 2936, 5138, 10276, 20552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20552: a Harshad number: divisible by its digit sum 14.
- 2
20552 is composite. Its prime factorisation is
- 3
The divisors add up to 44160; without 20552 itself that is 23608, so 20552 is abundant (23608 is more than 20552). Euler's totient φ(20552) = 8784 numbers up to 20552 share no factor with it.
- 4
The digits of 20552 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20552 = 2^{3} \times 7 \times 367 \]20552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 44160 |
| Euler totient φ(n) | 8784 |
| Square | 422384704 |
| Cube | 8680850436608 |
| Square root | 143.359687 (= 2√5138) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 56 |
| Scientific notation | 2.0552 × |
20552 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand five hundred and fifty-two |
| Binary (base 2) | 101000001001000 |
| Octal (base 8) | 50110 |
| Hexadecimal (base 16) | 5048 |
| Base 3 | 1001012012 |
| As time | 20552 seconds = 5 h 42 min 32 s |
Is 20552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20552 ÷ 2 = 10276) | 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 (20552 ÷ 4 = 5138) | 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 | Yes (20552 ÷ 7 = 2936) | 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 (20552 ÷ 8 = 2569) | 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 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 20552 a prime number?
No. 20552 = × 7 × 367, so it is divisible by 2.
What are the factors of 20552?
1, 2, 4, 7, 8, 14, 28, 56, 367, 734, 1468, 2569, 2936, 5138, 10276, 20552.
What is 20552 in binary?
101000001001000 (hexadecimal 5048, octal 50110).
What is the square root of 20552?
About 143.3597, exactly 2√5138.
Is 20552 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 20552?
20552 is a Harshad number: divisible by its digit sum 14.