The number 14290
14290 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1429. Divisors (8): 1, 2, 5, 10, 1429, 2858, 7145, 14290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14290 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14290 is composite. Its prime factorisation is
- 3
The divisors add up to 25740; without 14290 itself that is 11450, so 14290 is deficient (11450 is less than 14290). Euler's totient φ(14290) = 5712 numbers up to 14290 share no factor with it.
- 4
The digits of 14290 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14290 = 2 \times 5 \times 1429 \]
14290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25740 |
| Euler totient φ(n) | 5712 |
| Square | 204204100 |
| Cube | 2918076589000 |
| Square root | 119.540788 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 195 |
| Scientific notation | 1.429 × |
14290 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and ninety |
| Binary (base 2) | 11011111010010 |
| Octal (base 8) | 33722 |
| Hexadecimal (base 16) | 37D2 |
| Base 3 | 201121021 |
| As time | 14290 seconds = 3 h 58 min 10 s |
Is 14290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14290 ÷ 2 = 7145) | 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 (14290 ÷ 5 = 2858) | 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 3) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14290 ÷ 10 = 1429) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 14290 a prime number?
No. 14290 = 2 × 5 × 1429, so it is divisible by 2.
What are the factors of 14290?
1, 2, 5, 10, 1429, 2858, 7145, 14290.
What is 14290 in binary?
11011111010010 (hexadecimal 37D2, octal 33722).
What is the square root of 14290?
About 119.5408.
Is 14290 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 14290?
It is a composite number with 8 divisors.