The number 14690
14690 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 113. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 113, 130, 226, 565, 1130, 1469, 2938, 7345, 14690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14690 is composite. Its prime factorisation is
- 3
The divisors add up to 28728; without 14690 itself that is 14038, so 14690 is deficient (14038 is less than 14690). Euler's totient φ(14690) = 5376 numbers up to 14690 share no factor with it.
- 4
The digits of 14690 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 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14690 = 2 \times 5 \times 13 \times 113 \]
14690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 28728 |
| Euler totient φ(n) | 5376 |
| Square | 215796100 |
| Cube | 3170044709000 |
| Square root | 121.202310 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.469 × |
14690 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and ninety |
| Binary (base 2) | 11100101100010 |
| Octal (base 8) | 34542 |
| Hexadecimal (base 16) | 3962 |
| Base 3 | 202011002 |
| As time | 14690 seconds = 4 h 4 min 50 s |
Is 14690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14690 ÷ 2 = 7345) | 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 (14690 ÷ 5 = 2938) | 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 | Yes (14690 ÷ 10 = 1469) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 14690 a prime number?
No. 14690 = 2 × 5 × 13 × 113, so it is divisible by 2.
What are the factors of 14690?
1, 2, 5, 10, 13, 26, 65, 113, 130, 226, 565, 1130, 1469, 2938, 7345, 14690.
What is 14690 in binary?
11100101100010 (hexadecimal 3962, octal 34542).
What is the square root of 14690?
About 121.2023.
Is 14690 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14690?
It is a composite number with 16 divisors.