The number 51393
51393 is a composite number with 8 divisors. Its prime factorisation is 3 × 37 × 463. Divisors (8): 1, 3, 37, 111, 463, 1389, 17131, 51393.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51393 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51393 is composite. Its prime factorisation is
- 3
The divisors add up to 70528; without 51393 itself that is 19135, so 51393 is deficient (19135 is less than 51393). Euler's totient φ(51393) = 33264 numbers up to 51393 share no factor with it.
- 4
The digits of 51393 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51393 = 3 \times 37 \times 463 \]
51393 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70528 |
| Euler totient φ(n) | 33264 |
| Square | 2641240449 |
| Cube | 135741270395457 |
| Square root | 226.700243 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.1393 × |
51393 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and ninety-three |
| Binary (base 2) | 1100100011000001 |
| Octal (base 8) | 144301 |
| Hexadecimal (base 16) | C8C1 |
| Base 3 | 2121111110 |
| As time | 51393 seconds = 14 h 16 min 33 s |
Is 51393 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 (51393 ÷ 3 = 17131) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51393 a prime number?
No. 51393 = 3 × 37 × 463, so it is divisible by 3.
What are the factors of 51393?
1, 3, 37, 111, 463, 1389, 17131, 51393.
What is 51393 in binary?
1100100011000001 (hexadecimal C8C1, octal 144301).
What is the square root of 51393?
About 226.7002.
Is 51393 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51393?
It is a composite number with 8 divisors.