The number 13498
13498 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 397. Divisors (8): 1, 2, 17, 34, 397, 794, 6749, 13498.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13498 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13498 is composite. Its prime factorisation is
- 3
The divisors add up to 21492; without 13498 itself that is 7994, so 13498 is deficient (7994 is less than 13498). Euler's totient φ(13498) = 6336 numbers up to 13498 share no factor with it.
- 4
The digits of 13498 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13498 = 2 \times 17 \times 397 \]
13498 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21492 |
| Euler totient φ(n) | 6336 |
| Square | 182196004 |
| Cube | 2459281661992 |
| Square root | 116.180893 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.3498 × |
13498 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and ninety-eight |
| Binary (base 2) | 11010010111010 |
| Octal (base 8) | 32272 |
| Hexadecimal (base 16) | 34BA |
| Base 3 | 200111221 |
| As time | 13498 seconds = 3 h 44 min 58 s |
Is 13498 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13498 ÷ 2 = 6749) | 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 | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 1) | 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 13498 a prime number?
No. 13498 = 2 × 17 × 397, so it is divisible by 2.
What are the factors of 13498?
1, 2, 17, 34, 397, 794, 6749, 13498.
What is 13498 in binary?
11010010111010 (hexadecimal 34BA, octal 32272).
What is the square root of 13498?
About 116.1809.
Is 13498 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 13498?
It is a composite number with 8 divisors.