The number 13698
13698 is a composite number with 12 divisors. Its prime factorisation is 2 × × 761. Divisors (12): 1, 2, 3, 6, 9, 18, 761, 1522, 2283, 4566, 6849, 13698.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13698 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13698 is composite. Its prime factorisation is
- 3
The divisors add up to 29718; without 13698 itself that is 16020, so 13698 is abundant (16020 is more than 13698). Euler's totient φ(13698) = 4560 numbers up to 13698 share no factor with it.
- 4
The digits of 13698 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13698 = 2 \times 3^{2} \times 761 \]13698 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 29718 |
| Euler totient φ(n) | 4560 |
| Square | 187635204 |
| Cube | 2570227024392 |
| Square root | 117.038455 (= 3√1522) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.3698 × |
13698 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and ninety-eight |
| Binary (base 2) | 11010110000010 |
| Octal (base 8) | 32602 |
| Hexadecimal (base 16) | 3582 |
| Base 3 | 200210100 |
| As time | 13698 seconds = 3 h 48 min 18 s |
Is 13698 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13698 ÷ 2 = 6849) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13698 ÷ 3 = 4566) | 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 | Yes (13698 ÷ 6 = 2283) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (13698 ÷ 9 = 1522) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13698 a prime number?
No. 13698 = 2 × × 761, so it is divisible by 2.
What are the factors of 13698?
1, 2, 3, 6, 9, 18, 761, 1522, 2283, 4566, 6849, 13698.
What is 13698 in binary?
11010110000010 (hexadecimal 3582, octal 32602).
What is the square root of 13698?
About 117.0385, exactly 3√1522.
Is 13698 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 13698?
It is a composite number with 12 divisors.