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