The number 1558
1558 is a composite number with 8 divisors. Its prime factorisation is 2 × 19 × 41. Divisors (8): 1, 2, 19, 38, 41, 82, 779, 1558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1558: a Harshad number: divisible by its digit sum 19.
- 2
1558 is composite. Its prime factorisation is
- 3
The divisors add up to 2520; without 1558 itself that is 962, so 1558 is deficient (962 is less than 1558). Euler's totient φ(1558) = 720 numbers up to 1558 share no factor with it.
- 4
The digits of 1558 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1558 = 2 \times 19 \times 41 \]
1558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2520 |
| Euler totient φ(n) | 720 |
| Square | 2427364 |
| Cube | 3781833112 |
| Square root | 39.471509 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.558 × |
1558 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and fifty-eight |
| Roman numerals | MDLVIII |
| Binary (base 2) | 11000010110 |
| Octal (base 8) | 3026 |
| Hexadecimal (base 16) | 616 |
| Base 3 | 2010201 |
| As time | 1558 seconds = 25 min 58 s |
Is 1558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1558 ÷ 2 = 779) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 1) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1558 a prime number?
No. 1558 = 2 × 19 × 41, so it is divisible by 2.
What are the factors of 1558?
1, 2, 19, 38, 41, 82, 779, 1558.
What is 1558 in binary?
11000010110 (hexadecimal 616, octal 3026).
What is the square root of 1558?
About 39.4715.
What is 1558 in Roman numerals?
MDLVIII.
Is 1558 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 1558?
1558 is a Harshad number: divisible by its digit sum 19.