The number 51491
51491 is a composite number with 8 divisors. Its prime factorisation is 11 × 31 × 151. Divisors (8): 1, 11, 31, 151, 341, 1661, 4681, 51491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51491 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51491 is composite. Its prime factorisation is
- 3
The divisors add up to 58368; without 51491 itself that is 6877, so 51491 is deficient (6877 is less than 51491). Euler's totient φ(51491) = 45000 numbers up to 51491 share no factor with it.
- 4
The digits of 51491 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51491 = 11 \times 31 \times 151 \]
51491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58368 |
| Euler totient φ(n) | 45000 |
| Square | 2651323081 |
| Cube | 136519276763771 |
| Square root | 226.916284 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.1491 × |
51491 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and ninety-one |
| Binary (base 2) | 1100100100100011 |
| Octal (base 8) | 144443 |
| Hexadecimal (base 16) | C923 |
| Base 3 | 2121122002 |
| As time | 51491 seconds = 14 h 18 min 11 s |
Is 51491 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | 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 | Yes (51491 ÷ 11 = 4681) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51491 a prime number?
No. 51491 = 11 × 31 × 151, so it is divisible by 11.
What are the factors of 51491?
1, 11, 31, 151, 341, 1661, 4681, 51491.
What is 51491 in binary?
1100100100100011 (hexadecimal C923, octal 144443).
What is the square root of 51491?
About 226.9163.
Is 51491 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51491?
It is a composite number with 8 divisors.