The number 20558
20558 is a composite number with 8 divisors. Its prime factorisation is 2 × 19 × 541. Divisors (8): 1, 2, 19, 38, 541, 1082, 10279, 20558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20558 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20558 is composite. Its prime factorisation is
- 3
The divisors add up to 32520; without 20558 itself that is 11962, so 20558 is deficient (11962 is less than 20558). Euler's totient φ(20558) = 9720 numbers up to 20558 share no factor with it.
- 4
The digits of 20558 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 149 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20558 = 2 \times 19 \times 541 \]
20558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 32520 |
| Euler totient φ(n) | 9720 |
| Square | 422631364 |
| Cube | 8688455581112 |
| Square root | 143.380612 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 149 |
| Scientific notation | 2.0558 × |
20558 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand five hundred and fifty-eight |
| Binary (base 2) | 101000001001110 |
| Octal (base 8) | 50116 |
| Hexadecimal (base 16) | 504E |
| Base 3 | 1001012102 |
| As time | 20558 seconds = 5 h 42 min 38 s |
Is 20558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20558 ÷ 2 = 10279) | 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 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 6) | 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 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 10) | 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 20558 a prime number?
No. 20558 = 2 × 19 × 541, so it is divisible by 2.
What are the factors of 20558?
1, 2, 19, 38, 541, 1082, 10279, 20558.
What is 20558 in binary?
101000001001110 (hexadecimal 504E, octal 50116).
What is the square root of 20558?
About 143.3806.
Is 20558 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 20558?
It is a composite number with 8 divisors.