The number 559
559 is a composite number with 4 divisors. Its prime factorisation is 13 × 43. Divisors (4): 1, 13, 43, 559.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 559: a semiprime: 13 × 43, the product of two primes.
- 2
559 is composite. Its prime factorisation is
- 3
The divisors add up to 616; without 559 itself that is 57, so 559 is deficient (57 is less than 559). Euler's totient φ(559) = 504 numbers up to 559 share no factor with it.
- 4
The digits of 559 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 87 steps to reach 1.
LaTeX source of the formulas on this page
\[ 559 = 13 \times 43 \]
559 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 616 |
| Euler totient φ(n) | 504 |
| Square | 312481 |
| Cube | 174676879 |
| Square root | 23.643181 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 87 |
| Scientific notation | 5.59 × |
559 in other forms
| Form | Value |
|---|---|
| In words | five hundred and fifty-nine |
| Roman numerals | DLIX |
| Binary (base 2) | 1000101111 |
| Octal (base 8) | 1057 |
| Hexadecimal (base 16) | 22F |
| Base 3 | 202201 |
| As time | 559 seconds = 9 min 19 s |
Is 559 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 559 a prime number?
No. 559 = 13 × 43, so it is divisible by 13.
What are the factors of 559?
1, 13, 43, 559.
What is 559 in binary?
1000101111 (hexadecimal 22F, octal 1057).
What is the square root of 559?
About 23.6432.
What is 559 in Roman numerals?
DLIX.
Is 559 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 559?
559 is a semiprime: 13 × 43, the product of two primes.