The number 13491
13491 is a composite number with 6 divisors. Its prime factorisation is × 1499. Divisors (6): 1, 3, 9, 1499, 4497, 13491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13491 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13491 is composite. Its prime factorisation is
- 3
The divisors add up to 19500; without 13491 itself that is 6009, so 13491 is deficient (6009 is less than 13491). Euler's totient φ(13491) = 8988 numbers up to 13491 share no factor with it.
- 4
The digits of 13491 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13491 = 3^{2} \times 1499 \]13491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 19500 |
| Euler totient φ(n) | 8988 |
| Square | 182007081 |
| Cube | 2455457529771 |
| Square root | 116.150764 (= 3√1499) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.3491 × |
13491 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and ninety-one |
| Binary (base 2) | 11010010110011 |
| Octal (base 8) | 32263 |
| Hexadecimal (base 16) | 34B3 |
| Base 3 | 200111200 |
| As time | 13491 seconds = 3 h 44 min 51 s |
Is 13491 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 (13491 ÷ 3 = 4497) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (13491 ÷ 9 = 1499) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13491 a prime number?
No. 13491 = × 1499, so it is divisible by 3.
What are the factors of 13491?
1, 3, 9, 1499, 4497, 13491.
What is 13491 in binary?
11010010110011 (hexadecimal 34B3, octal 32263).
What is the square root of 13491?
About 116.1508, exactly 3√1499.
Is 13491 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 13491?
It is a composite number with 6 divisors.