The number 51022
51022 is a composite number with 8 divisors. Its prime factorisation is 2 × 97 × 263. Divisors (8): 1, 2, 97, 194, 263, 526, 25511, 51022.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51022 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51022 is composite. Its prime factorisation is
- 3
The divisors add up to 77616; without 51022 itself that is 26594, so 51022 is deficient (26594 is less than 51022). Euler's totient φ(51022) = 25152 numbers up to 51022 share no factor with it.
- 4
The digits of 51022 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51022 = 2 \times 97 \times 263 \]
51022 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77616 |
| Euler totient φ(n) | 25152 |
| Square | 2603244484 |
| Cube | 132822740062648 |
| Square root | 225.880499 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.1022 × |
51022 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and twenty-two |
| Binary (base 2) | 1100011101001110 |
| Octal (base 8) | 143516 |
| Hexadecimal (base 16) | C74E |
| Base 3 | 2120222201 |
| As time | 51022 seconds = 14 h 10 min 22 s |
Is 51022 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51022 ÷ 2 = 25511) | 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 | 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 4) | 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 6) | 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 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51022 a prime number?
No. 51022 = 2 × 97 × 263, so it is divisible by 2.
What are the factors of 51022?
1, 2, 97, 194, 263, 526, 25511, 51022.
What is 51022 in binary?
1100011101001110 (hexadecimal C74E, octal 143516).
What is the square root of 51022?
About 225.8805.
Is 51022 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 51022?
It is a composite number with 8 divisors.