The number 15590
15590 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1559. Divisors (8): 1, 2, 5, 10, 1559, 3118, 7795, 15590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15590 is composite. Its prime factorisation is
- 3
The divisors add up to 28080; without 15590 itself that is 12490, so 15590 is deficient (12490 is less than 15590). Euler's totient φ(15590) = 6232 numbers up to 15590 share no factor with it.
- 4
The digits of 15590 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15590 = 2 \times 5 \times 1559 \]
15590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 28080 |
| Euler totient φ(n) | 6232 |
| Square | 243048100 |
| Cube | 3789119879000 |
| Square root | 124.859922 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.559 × |
15590 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and ninety |
| Binary (base 2) | 11110011100110 |
| Octal (base 8) | 36346 |
| Hexadecimal (base 16) | 3CE6 |
| Base 3 | 210101102 |
| As time | 15590 seconds = 4 h 19 min 50 s |
Is 15590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15590 ÷ 2 = 7795) | 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 | Yes (15590 ÷ 5 = 3118) | 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 | No (remainder 1) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15590 ÷ 10 = 1559) | 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 15590 a prime number?
No. 15590 = 2 × 5 × 1559, so it is divisible by 2.
What are the factors of 15590?
1, 2, 5, 10, 1559, 3118, 7795, 15590.
What is 15590 in binary?
11110011100110 (hexadecimal 3CE6, octal 36346).
What is the square root of 15590?
About 124.8599.
Is 15590 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15590?
It is a composite number with 8 divisors.