The number 14989
14989 is a composite number with 4 divisors. Its prime factorisation is 13 × 1153. Divisors (4): 1, 13, 1153, 14989.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14989: a semiprime: 13 × 1153, the product of two primes.
- 2
14989 is composite. Its prime factorisation is
- 3
The divisors add up to 16156; without 14989 itself that is 1167, so 14989 is deficient (1167 is less than 14989). Euler's totient φ(14989) = 13824 numbers up to 14989 share no factor with it.
- 4
The digits of 14989 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14989 = 13 \times 1153 \]
14989 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16156 |
| Euler totient φ(n) | 13824 |
| Square | 224670121 |
| Cube | 3367580443669 |
| Square root | 122.429572 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4989 × |
14989 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and eighty-nine |
| Binary (base 2) | 11101010001101 |
| Octal (base 8) | 35215 |
| Hexadecimal (base 16) | 3A8D |
| Base 3 | 202120011 |
| As time | 14989 seconds = 4 h 9 min 49 s |
Is 14989 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14989 a prime number?
No. 14989 = 13 × 1153, so it is divisible by 13.
What are the factors of 14989?
1, 13, 1153, 14989.
What is 14989 in binary?
11101010001101 (hexadecimal 3A8D, octal 35215).
What is the square root of 14989?
About 122.4296.
Is 14989 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 14989?
14989 is a semiprime: 13 × 1153, the product of two primes.