The number 5491
5491 is a composite number with 6 divisors. Its prime factorisation is Ć 19. Divisors (6): 1, 17, 19, 289, 323, 5491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5491: a Harshad number: divisible by its digit sum 19.
- 2
5491 is composite. Its prime factorisation is
- 3
The divisors add up to 6140; without 5491 itself that is 649, so 5491 is deficient (649 is less than 5491). Euler's totient Ļ(5491) = 4896 numbers up to 5491 share no factor with it.
- 4
The digits of 5491 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5491 = 17^{2} \times 19 \]5491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 6140 |
| Euler totient Ļ(n) | 4896 |
| Square | 30151081 |
| Cube | 165559585771 |
| Square root | 74.101282 (= 17ā19) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 41 |
| Scientific notation | 5.491 Ć |
5491 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and ninety-one |
| Binary (base 2) | 1010101110011 |
| Octal (base 8) | 12563 |
| Hexadecimal (base 16) | 1573 |
| Base 3 | 21112101 |
| As time | 5491 seconds = 1 h 31 min 31 s |
Is 5491 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 | No (remainder 3) | 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 1) | 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 2) | 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 5491 a prime number?
No. 5491 = Ć 19, so it is divisible by 17.
What are the factors of 5491?
1, 17, 19, 289, 323, 5491.
What is 5491 in binary?
1010101110011 (hexadecimal 1573, octal 12563).
What is the square root of 5491?
About 74.1013, exactly 17ā19.
Is 5491 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 5491?
5491 is a Harshad number: divisible by its digit sum 19.