The number 8491
8491 is a composite number with 4 divisors. Its prime factorisation is 7 × 1213. Divisors (4): 1, 7, 1213, 8491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8491: a semiprime: 7 × 1213, the product of two primes.
- 2
8491 is composite. Its prime factorisation is
- 3
The divisors add up to 9712; without 8491 itself that is 1221, so 8491 is deficient (1221 is less than 8491). Euler's totient φ(8491) = 7272 numbers up to 8491 share no factor with it.
- 4
The digits of 8491 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8491 = 7 \times 1213 \]
8491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9712 |
| Euler totient φ(n) | 7272 |
| Square | 72097081 |
| Cube | 612176314771 |
| Square root | 92.146622 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 8.491 × |
8491 in other forms
| Form | Value |
|---|---|
| In words | eight thousand four hundred and ninety-one |
| Binary (base 2) | 10000100101011 |
| Octal (base 8) | 20453 |
| Hexadecimal (base 16) | 212B |
| Base 3 | 102122111 |
| As time | 8491 seconds = 2 h 21 min 31 s |
Is 8491 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (8491 ÷ 7 = 1213) | 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 4) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8491 a prime number?
No. 8491 = 7 × 1213, so it is divisible by 7.
What are the factors of 8491?
1, 7, 1213, 8491.
What is 8491 in binary?
10000100101011 (hexadecimal 212B, octal 20453).
What is the square root of 8491?
About 92.1466.
Is 8491 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 8491?
8491 is a semiprime: 7 × 1213, the product of two primes.