The number 5558
5558 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 397. Divisors (8): 1, 2, 7, 14, 397, 794, 2779, 5558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5558: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
5558 is composite. Its prime factorisation is
- 3
The divisors add up to 9552; without 5558 itself that is 3994, so 5558 is deficient (3994 is less than 5558). Euler's totient φ(5558) = 2376 numbers up to 5558 share no factor with it.
- 4
The digits of 5558 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5558 = 2 \times 7 \times 397 \]
5558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 9552 |
| Euler totient φ(n) | 2376 |
| Square | 30891364 |
| Cube | 171694201112 |
| Square root | 74.551995 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 160 |
| Scientific notation | 5.558 × |
5558 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and fifty-eight |
| Binary (base 2) | 1010110110110 |
| Octal (base 8) | 12666 |
| Hexadecimal (base 16) | 15B6 |
| Base 3 | 21121212 |
| As time | 5558 seconds = 1 h 32 min 38 s |
Is 5558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5558 ÷ 2 = 2779) | 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 | Yes (5558 ÷ 7 = 794) | 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 5) | 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 3) | 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 5558 a prime number?
No. 5558 = 2 × 7 × 397, so it is divisible by 2.
What are the factors of 5558?
1, 2, 7, 14, 397, 794, 2779, 5558.
What is 5558 in binary?
1010110110110 (hexadecimal 15B6, octal 12666).
What is the square root of 5558?
About 74.5520.
Is 5558 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 5558?
5558 is a happy number: repeatedly adding the squares of its digits reaches 1.