The number 1586
1586 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 61. Divisors (8): 1, 2, 13, 26, 61, 122, 793, 1586.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1586 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1586 is composite. Its prime factorisation is
- 3
The divisors add up to 2604; without 1586 itself that is 1018, so 1586 is deficient (1018 is less than 1586). Euler's totient φ(1586) = 720 numbers up to 1586 share no factor with it.
- 4
The digits of 1586 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1586 = 2 \times 13 \times 61 \]
1586 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2604 |
| Euler totient φ(n) | 720 |
| Square | 2515396 |
| Cube | 3989418056 |
| Square root | 39.824616 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 78 |
| Scientific notation | 1.586 × |
1586 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and eighty-six |
| Roman numerals | MDLXXXVI |
| Binary (base 2) | 11000110010 |
| Octal (base 8) | 3062 |
| Hexadecimal (base 16) | 632 |
| Base 3 | 2011202 |
| As time | 1586 seconds = 26 min 26 s |
Is 1586 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1586 ÷ 2 = 793) | 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 | No (remainder 1) | 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 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 2) | 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 | No (remainder 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1586 a prime number?
No. 1586 = 2 × 13 × 61, so it is divisible by 2.
What are the factors of 1586?
1, 2, 13, 26, 61, 122, 793, 1586.
What is 1586 in binary?
11000110010 (hexadecimal 632, octal 3062).
What is the square root of 1586?
About 39.8246.
What is 1586 in Roman numerals?
MDLXXXVI.
Is 1586 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 1586?
It is a composite number with 8 divisors.