The number 558
558 is a composite number with 12 divisors. Its prime factorisation is 2 × × 31. Divisors (12): 1, 2, 3, 6, 9, 18, 31, 62, 93, 186, 279, 558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 558: a Harshad number: divisible by its digit sum 18.
- 2
558 is composite. Its prime factorisation is
- 3
The divisors add up to 1248; without 558 itself that is 690, so 558 is abundant (690 is more than 558). Euler's totient φ(558) = 180 numbers up to 558 share no factor with it.
- 4
The digits of 558 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 558 = 2 \times 3^{2} \times 31 \]558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 1248 |
| Euler totient φ(n) | 180 |
| Square | 311364 |
| Cube | 173741112 |
| Square root | 23.622024 (= 3√62) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 43 |
| Scientific notation | 5.58 × |
558 in other forms
| Form | Value |
|---|---|
| In words | five hundred and fifty-eight |
| Roman numerals | DLVIII |
| Binary (base 2) | 1000101110 |
| Octal (base 8) | 1056 |
| Hexadecimal (base 16) | 22E |
| Base 3 | 202200 |
| As time | 558 seconds = 9 min 18 s |
Is 558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (558 ÷ 2 = 279) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (558 ÷ 3 = 186) | 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 (558 ÷ 6 = 93) | 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 | Yes (558 ÷ 9 = 62) | 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 8) | 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 558 a prime number?
No. 558 = 2 × × 31, so it is divisible by 2.
What are the factors of 558?
1, 2, 3, 6, 9, 18, 31, 62, 93, 186, 279, 558.
What is 558 in binary?
1000101110 (hexadecimal 22E, octal 1056).
What is the square root of 558?
About 23.6220, exactly 3√62.
What is 558 in Roman numerals?
DLVIII.
Is 558 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 558?
558 is a Harshad number: divisible by its digit sum 18.