The number 5091
5091 is a composite number with 4 divisors. Its prime factorisation is 3 × 1697. Divisors (4): 1, 3, 1697, 5091.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5091: a semiprime: 3 × 1697, the product of two primes.
- 2
5091 is composite. Its prime factorisation is
- 3
The divisors add up to 6792; without 5091 itself that is 1701, so 5091 is deficient (1701 is less than 5091). Euler's totient φ(5091) = 3392 numbers up to 5091 share no factor with it.
- 4
The digits of 5091 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5091 = 3 \times 1697 \]
5091 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6792 |
| Euler totient φ(n) | 3392 |
| Square | 25918281 |
| Cube | 131949968571 |
| Square root | 71.351244 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 41 |
| Scientific notation | 5.091 × |
5091 in other forms
| Form | Value |
|---|---|
| In words | five thousand and ninety-one |
| Binary (base 2) | 1001111100011 |
| Octal (base 8) | 11743 |
| Hexadecimal (base 16) | 13E3 |
| Base 3 | 20222120 |
| As time | 5091 seconds = 1 h 24 min 51 s |
Is 5091 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 (5091 ÷ 3 = 1697) | 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 | 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 9) | 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 5091 a prime number?
No. 5091 = 3 × 1697, so it is divisible by 3.
What are the factors of 5091?
1, 3, 1697, 5091.
What is 5091 in binary?
1001111100011 (hexadecimal 13E3, octal 11743).
What is the square root of 5091?
About 71.3512.
Is 5091 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5091?
5091 is a semiprime: 3 × 1697, the product of two primes.