The number 21558
21558 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 3593. Divisors (8): 1, 2, 3, 6, 3593, 7186, 10779, 21558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
21558 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
21558 is composite. Its prime factorisation is
- 3
The divisors add up to 43128; without 21558 itself that is 21570, so 21558 is abundant (21570 is more than 21558). Euler's totient φ(21558) = 7184 numbers up to 21558 share no factor with it.
- 4
The digits of 21558 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 149 steps to reach 1.
LaTeX source of the formulas on this page
\[ 21558 = 2 \times 3 \times 3593 \]
21558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 43128 |
| Euler totient φ(n) | 7184 |
| Square | 464747364 |
| Cube | 10019023673112 |
| Square root | 146.826428 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 149 |
| Scientific notation | 2.1558 × |
21558 in other forms
| Form | Value |
|---|---|
| In words | twenty-one thousand five hundred and fifty-eight |
| Binary (base 2) | 101010000110110 |
| Octal (base 8) | 52066 |
| Hexadecimal (base 16) | 5436 |
| Base 3 | 1002120110 |
| As time | 21558 seconds = 5 h 59 min 18 s |
Is 21558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (21558 ÷ 2 = 10779) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (21558 ÷ 3 = 7186) | 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 | Yes (21558 ÷ 6 = 3593) | 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 21558 a prime number?
No. 21558 = 2 × 3 × 3593, so it is divisible by 2.
What are the factors of 21558?
1, 2, 3, 6, 3593, 7186, 10779, 21558.
What is 21558 in binary?
101010000110110 (hexadecimal 5436, octal 52066).
What is the square root of 21558?
About 146.8264.
Is 21558 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 21558?
It is a composite number with 8 divisors.