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