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