The number 51222
51222 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8537. Divisors (8): 1, 2, 3, 6, 8537, 17074, 25611, 51222.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51222 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51222 is composite. Its prime factorisation is
- 3
The divisors add up to 102456; without 51222 itself that is 51234, so 51222 is abundant (51234 is more than 51222). Euler's totient φ(51222) = 17072 numbers up to 51222 share no factor with it.
- 4
The digits of 51222 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51222 = 2 \times 3 \times 8537 \]
51222 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102456 |
| Euler totient φ(n) | 17072 |
| Square | 2623693284 |
| Cube | 134390817393048 |
| Square root | 226.322778 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1222 × |
51222 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and twenty-two |
| Binary (base 2) | 1100100000010110 |
| Octal (base 8) | 144026 |
| Hexadecimal (base 16) | C816 |
| Base 3 | 2121021010 |
| As time | 51222 seconds = 14 h 13 min 42 s |
Is 51222 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51222 ÷ 2 = 25611) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51222 ÷ 3 = 17074) | 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 | Yes (51222 ÷ 6 = 8537) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51222 a prime number?
No. 51222 = 2 × 3 × 8537, so it is divisible by 2.
What are the factors of 51222?
1, 2, 3, 6, 8537, 17074, 25611, 51222.
What is 51222 in binary?
1100100000010110 (hexadecimal C816, octal 144026).
What is the square root of 51222?
About 226.3228.
Is 51222 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51222?
It is a composite number with 8 divisors.