The number 16559
16559 is a composite number with 4 divisors. Its prime factorisation is 29 × 571. Divisors (4): 1, 29, 571, 16559.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16559: a semiprime: 29 × 571, the product of two primes.
- 2
16559 is composite. Its prime factorisation is
- 3
The divisors add up to 17160; without 16559 itself that is 601, so 16559 is deficient (601 is less than 16559). Euler's totient φ(16559) = 15960 numbers up to 16559 share no factor with it.
- 4
The digits of 16559 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 141 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16559 = 29 \times 571 \]
16559 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17160 |
| Euler totient φ(n) | 15960 |
| Square | 274200481 |
| Cube | 4540485764879 |
| Square root | 128.681778 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 141 |
| Scientific notation | 1.6559 × |
16559 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and fifty-nine |
| Binary (base 2) | 100000010101111 |
| Octal (base 8) | 40257 |
| Hexadecimal (base 16) | 40AF |
| Base 3 | 211201022 |
| As time | 16559 seconds = 4 h 35 min 59 s |
Is 16559 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16559 a prime number?
No. 16559 = 29 × 571, so it is divisible by 29.
What are the factors of 16559?
1, 29, 571, 16559.
What is 16559 in binary?
100000010101111 (hexadecimal 40AF, octal 40257).
What is the square root of 16559?
About 128.6818.
Is 16559 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 16559?
16559 is a semiprime: 29 × 571, the product of two primes.