The number 12590
12590 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1259. Divisors (8): 1, 2, 5, 10, 1259, 2518, 6295, 12590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12590 is composite. Its prime factorisation is
- 3
The divisors add up to 22680; without 12590 itself that is 10090, so 12590 is deficient (10090 is less than 12590). Euler's totient φ(12590) = 5032 numbers up to 12590 share no factor with it.
- 4
The digits of 12590 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12590 = 2 \times 5 \times 1259 \]
12590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22680 |
| Euler totient φ(n) | 5032 |
| Square | 158508100 |
| Cube | 1995616979000 |
| Square root | 112.205169 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 125 |
| Scientific notation | 1.259 × |
12590 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and ninety |
| Binary (base 2) | 11000100101110 |
| Octal (base 8) | 30456 |
| Hexadecimal (base 16) | 312E |
| Base 3 | 122021022 |
| As time | 12590 seconds = 3 h 29 min 50 s |
Is 12590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12590 ÷ 2 = 6295) | 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 (12590 ÷ 5 = 2518) | 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 6) | 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 | Yes (12590 ÷ 10 = 1259) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 12590 a prime number?
No. 12590 = 2 × 5 × 1259, so it is divisible by 2.
What are the factors of 12590?
1, 2, 5, 10, 1259, 2518, 6295, 12590.
What is 12590 in binary?
11000100101110 (hexadecimal 312E, octal 30456).
What is the square root of 12590?
About 112.2052.
Is 12590 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 12590?
It is a composite number with 8 divisors.