The number 10491
10491 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 269. Divisors (8): 1, 3, 13, 39, 269, 807, 3497, 10491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10491 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10491 is composite. Its prime factorisation is
- 3
The divisors add up to 15120; without 10491 itself that is 4629, so 10491 is deficient (4629 is less than 10491). Euler's totient φ(10491) = 6432 numbers up to 10491 share no factor with it.
- 4
The digits of 10491 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10491 = 3 \times 13 \times 269 \]
10491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15120 |
| Euler totient φ(n) | 6432 |
| Square | 110061081 |
| Cube | 1154650800771 |
| Square root | 102.425583 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 86 |
| Scientific notation | 1.0491 × |
10491 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and ninety-one |
| Binary (base 2) | 10100011111011 |
| Octal (base 8) | 24373 |
| Hexadecimal (base 16) | 28FB |
| Base 3 | 112101120 |
| As time | 10491 seconds = 2 h 54 min 51 s |
Is 10491 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 (10491 ÷ 3 = 3497) | 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 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 10491 a prime number?
No. 10491 = 3 × 13 × 269, so it is divisible by 3.
What are the factors of 10491?
1, 3, 13, 39, 269, 807, 3497, 10491.
What is 10491 in binary?
10100011111011 (hexadecimal 28FB, octal 24373).
What is the square root of 10491?
About 102.4256.
Is 10491 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 10491?
It is a composite number with 8 divisors.