The number 51363
51363 is a composite number with 12 divisors. Its prime factorisation is × 13 × 439. Divisors (12): 1, 3, 9, 13, 39, 117, 439, 1317, 3951, 5707, 17121, 51363.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51363 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51363 is composite. Its prime factorisation is
- 3
The divisors add up to 80080; without 51363 itself that is 28717, so 51363 is deficient (28717 is less than 51363). Euler's totient φ(51363) = 31536 numbers up to 51363 share no factor with it.
- 4
The digits of 51363 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51363 = 3^{2} \times 13 \times 439 \]51363 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 80080 |
| Euler totient φ(n) | 31536 |
| Square | 2638157769 |
| Cube | 135503697489147 |
| Square root | 226.634066 (= 3√5707) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1363 × |
51363 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and sixty-three |
| Binary (base 2) | 1100100010100011 |
| Octal (base 8) | 144243 |
| Hexadecimal (base 16) | C8A3 |
| Base 3 | 2121110100 |
| As time | 51363 seconds = 14 h 16 min 3 s |
Is 51363 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 (51363 ÷ 3 = 17121) | 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 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (51363 ÷ 9 = 5707) | 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 4) | 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 51363 a prime number?
No. 51363 = × 13 × 439, so it is divisible by 3.
What are the factors of 51363?
1, 3, 9, 13, 39, 117, 439, 1317, 3951, 5707, 17121, 51363.
What is 51363 in binary?
1100100010100011 (hexadecimal C8A3, octal 144243).
What is the square root of 51363?
About 226.6341, exactly 3√5707.
Is 51363 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51363?
It is a composite number with 12 divisors.