The number 51364
51364 is a composite number with 6 divisors. Its prime factorisation is × 12841. Divisors (6): 1, 2, 4, 12841, 25682, 51364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51364 is composite. Its prime factorisation is
- 3
The divisors add up to 89894; without 51364 itself that is 38530, so 51364 is deficient (38530 is less than 51364). Euler's totient φ(51364) = 25680 numbers up to 51364 share no factor with it.
- 4
The digits of 51364 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 163 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51364 = 2^{2} \times 12841 \]51364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 89894 |
| Euler totient φ(n) | 25680 |
| Square | 2638260496 |
| Cube | 135511612116544 |
| Square root | 226.636272 (= 2√12841) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 163 |
| Scientific notation | 5.1364 × |
51364 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and sixty-four |
| Binary (base 2) | 1100100010100100 |
| Octal (base 8) | 144244 |
| Hexadecimal (base 16) | C8A4 |
| Base 3 | 2121110101 |
| As time | 51364 seconds = 14 h 16 min 4 s |
Is 51364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51364 ÷ 2 = 25682) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (51364 ÷ 4 = 12841) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51364 a prime number?
No. 51364 = × 12841, so it is divisible by 2.
What are the factors of 51364?
1, 2, 4, 12841, 25682, 51364.
What is 51364 in binary?
1100100010100100 (hexadecimal C8A4, octal 144244).
What is the square root of 51364?
About 226.6363, exactly 2√12841.
Is 51364 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51364?
It is a composite number with 6 divisors.