The number 51293
51293 is a composite number with 4 divisors. Its prime factorisation is 11 × 4663. Divisors (4): 1, 11, 4663, 51293.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51293: a semiprime: 11 × 4663, the product of two primes.
- 2
51293 is composite. Its prime factorisation is
- 3
The divisors add up to 55968; without 51293 itself that is 4675, so 51293 is deficient (4675 is less than 51293). Euler's totient φ(51293) = 46620 numbers up to 51293 share no factor with it.
- 4
The digits of 51293 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51293 = 11 \times 4663 \]
51293 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55968 |
| Euler totient φ(n) | 46620 |
| Square | 2630971849 |
| Cube | 134950439050757 |
| Square root | 226.479580 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.1293 × |
51293 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and ninety-three |
| Binary (base 2) | 1100100001011101 |
| Octal (base 8) | 144135 |
| Hexadecimal (base 16) | C85D |
| Base 3 | 2121100202 |
| As time | 51293 seconds = 14 h 14 min 53 s |
Is 51293 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 4) | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (51293 ÷ 11 = 4663) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51293 a prime number?
No. 51293 = 11 × 4663, so it is divisible by 11.
What are the factors of 51293?
1, 11, 4663, 51293.
What is 51293 in binary?
1100100001011101 (hexadecimal C85D, octal 144135).
What is the square root of 51293?
About 226.4796.
Is 51293 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51293?
51293 is a semiprime: 11 × 4663, the product of two primes.