The number 16558
16558 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 487. Divisors (8): 1, 2, 17, 34, 487, 974, 8279, 16558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16558 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16558 is composite. Its prime factorisation is
- 3
The divisors add up to 26352; without 16558 itself that is 9794, so 16558 is deficient (9794 is less than 16558). Euler's totient φ(16558) = 7776 numbers up to 16558 share no factor with it.
- 4
The digits of 16558 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16558 = 2 \times 17 \times 487 \]
16558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26352 |
| Euler totient φ(n) | 7776 |
| Square | 274167364 |
| Cube | 4539663213112 |
| Square root | 128.677892 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 159 |
| Scientific notation | 1.6558 × |
16558 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and fifty-eight |
| Binary (base 2) | 100000010101110 |
| Octal (base 8) | 40256 |
| Hexadecimal (base 16) | 40AE |
| Base 3 | 211201021 |
| As time | 16558 seconds = 4 h 35 min 58 s |
Is 16558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16558 ÷ 2 = 8279) | 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 3) | 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 7) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16558 a prime number?
No. 16558 = 2 × 17 × 487, so it is divisible by 2.
What are the factors of 16558?
1, 2, 17, 34, 487, 974, 8279, 16558.
What is 16558 in binary?
100000010101110 (hexadecimal 40AE, octal 40256).
What is the square root of 16558?
About 128.6779.
Is 16558 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 16558?
It is a composite number with 8 divisors.