The number 5590
5590 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 43. Divisors (16): 1, 2, 5, 10, 13, 26, 43, 65, 86, 130, 215, 430, 559, 1118, 2795, 5590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5590 is composite. Its prime factorisation is
- 3
The divisors add up to 11088; without 5590 itself that is 5498, so 5590 is deficient (5498 is less than 5590). Euler's totient φ(5590) = 2016 numbers up to 5590 share no factor with it.
- 4
The digits of 5590 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 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5590 = 2 \times 5 \times 13 \times 43 \]
5590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 11088 |
| Euler totient φ(n) | 2016 |
| Square | 31248100 |
| Cube | 174676879000 |
| Square root | 74.766303 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 67 |
| Scientific notation | 5.59 × |
5590 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and ninety |
| Binary (base 2) | 1010111010110 |
| Octal (base 8) | 12726 |
| Hexadecimal (base 16) | 15D6 |
| Base 3 | 21200001 |
| As time | 5590 seconds = 1 h 33 min 10 s |
Is 5590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5590 ÷ 2 = 2795) | 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 | Yes (5590 ÷ 5 = 1118) | 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 | Yes (5590 ÷ 10 = 559) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 5590 a prime number?
No. 5590 = 2 × 5 × 13 × 43, so it is divisible by 2.
What are the factors of 5590?
1, 2, 5, 10, 13, 26, 43, 65, 86, 130, 215, 430, 559, 1118, 2795, 5590.
What is 5590 in binary?
1010111010110 (hexadecimal 15D6, octal 12726).
What is the square root of 5590?
About 74.7663.
Is 5590 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 5590?
It is a composite number with 16 divisors.