The number 1498
1498 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 107. Divisors (8): 1, 2, 7, 14, 107, 214, 749, 1498.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1498 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1498 is composite. Its prime factorisation is
- 3
The divisors add up to 2592; without 1498 itself that is 1094, so 1498 is deficient (1094 is less than 1498). Euler's totient φ(1498) = 636 numbers up to 1498 share no factor with it.
- 4
The digits of 1498 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1498 = 2 \times 7 \times 107 \]
1498 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2592 |
| Euler totient φ(n) | 636 |
| Square | 2244004 |
| Cube | 3361517992 |
| Square root | 38.704005 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.498 × |
1498 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and ninety-eight |
| Roman numerals | MCDXCVIII |
| Binary (base 2) | 10111011010 |
| Octal (base 8) | 2732 |
| Hexadecimal (base 16) | 5DA |
| Base 3 | 2001111 |
| As time | 1498 seconds = 24 min 58 s |
Is 1498 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1498 ÷ 2 = 749) | 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 | No (remainder 3) | 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 | Yes (1498 ÷ 7 = 214) | 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 4) | 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 | No (remainder 2) | 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 1498 a prime number?
No. 1498 = 2 × 7 × 107, so it is divisible by 2.
What are the factors of 1498?
1, 2, 7, 14, 107, 214, 749, 1498.
What is 1498 in binary?
10111011010 (hexadecimal 5DA, octal 2732).
What is the square root of 1498?
About 38.7040.
What is 1498 in Roman numerals?
MCDXCVIII.
Is 1498 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 1498?
It is a composite number with 8 divisors.