The number 13497
13497 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 409. Divisors (8): 1, 3, 11, 33, 409, 1227, 4499, 13497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13497 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13497 is composite. Its prime factorisation is
- 3
The divisors add up to 19680; without 13497 itself that is 6183, so 13497 is deficient (6183 is less than 13497). Euler's totient φ(13497) = 8160 numbers up to 13497 share no factor with it.
- 4
The digits of 13497 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13497 = 3 \times 11 \times 409 \]
13497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19680 |
| Euler totient φ(n) | 8160 |
| Square | 182169009 |
| Cube | 2458735114473 |
| Square root | 116.176590 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 182 |
| Scientific notation | 1.3497 × |
13497 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and ninety-seven |
| Binary (base 2) | 11010010111001 |
| Octal (base 8) | 32271 |
| Hexadecimal (base 16) | 34B9 |
| Base 3 | 200111220 |
| As time | 13497 seconds = 3 h 44 min 57 s |
Is 13497 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13497 ÷ 3 = 4499) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (13497 ÷ 11 = 1227) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13497 a prime number?
No. 13497 = 3 × 11 × 409, so it is divisible by 3.
What are the factors of 13497?
1, 3, 11, 33, 409, 1227, 4499, 13497.
What is 13497 in binary?
11010010111001 (hexadecimal 34B9, octal 32271).
What is the square root of 13497?
About 116.1766.
Is 13497 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 13497?
It is a composite number with 8 divisors.