The number 14590
14590 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1459. Divisors (8): 1, 2, 5, 10, 1459, 2918, 7295, 14590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14590 is composite. Its prime factorisation is
- 3
The divisors add up to 26280; without 14590 itself that is 11690, so 14590 is deficient (11690 is less than 14590). Euler's totient φ(14590) = 5832 numbers up to 14590 share no factor with it.
- 4
The digits of 14590 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14590 = 2 \times 5 \times 1459 \]
14590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26280 |
| Euler totient φ(n) | 5832 |
| Square | 212868100 |
| Cube | 3105745579000 |
| Square root | 120.789072 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.459 × |
14590 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and ninety |
| Binary (base 2) | 11100011111110 |
| Octal (base 8) | 34376 |
| Hexadecimal (base 16) | 38FE |
| Base 3 | 202000101 |
| As time | 14590 seconds = 4 h 3 min 10 s |
Is 14590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14590 ÷ 2 = 7295) | 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 (14590 ÷ 5 = 2918) | 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 2) | 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 (14590 ÷ 10 = 1459) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 14590 a prime number?
No. 14590 = 2 × 5 × 1459, so it is divisible by 2.
What are the factors of 14590?
1, 2, 5, 10, 1459, 2918, 7295, 14590.
What is 14590 in binary?
11100011111110 (hexadecimal 38FE, octal 34376).
What is the square root of 14590?
About 120.7891.
Is 14590 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14590?
It is a composite number with 8 divisors.