The number 13298
13298 is a composite number with 8 divisors. Its prime factorisation is 2 × 61 × 109. Divisors (8): 1, 2, 61, 109, 122, 218, 6649, 13298.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13298 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13298 is composite. Its prime factorisation is
- 3
The divisors add up to 20460; without 13298 itself that is 7162, so 13298 is deficient (7162 is less than 13298). Euler's totient φ(13298) = 6480 numbers up to 13298 share no factor with it.
- 4
The digits of 13298 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 169 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13298 = 2 \times 61 \times 109 \]
13298 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20460 |
| Euler totient φ(n) | 6480 |
| Square | 176836804 |
| Cube | 2351575819592 |
| Square root | 115.316955 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 169 |
| Scientific notation | 1.3298 × |
13298 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand two hundred and ninety-eight |
| Binary (base 2) | 11001111110010 |
| Octal (base 8) | 31762 |
| Hexadecimal (base 16) | 33F2 |
| Base 3 | 200020112 |
| As time | 13298 seconds = 3 h 41 min 38 s |
Is 13298 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13298 ÷ 2 = 6649) | 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 5) | 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 5) | 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 10) | 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 13298 a prime number?
No. 13298 = 2 × 61 × 109, so it is divisible by 2.
What are the factors of 13298?
1, 2, 61, 109, 122, 218, 6649, 13298.
What is 13298 in binary?
11001111110010 (hexadecimal 33F2, octal 31762).
What is the square root of 13298?
About 115.3170.
Is 13298 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 13298?
It is a composite number with 8 divisors.