The number 51010
51010 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5101. Divisors (8): 1, 2, 5, 10, 5101, 10202, 25505, 51010.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51010 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51010 is composite. Its prime factorisation is
- 3
The divisors add up to 91836; without 51010 itself that is 40826, so 51010 is deficient (40826 is less than 51010). Euler's totient φ(51010) = 20400 numbers up to 51010 share no factor with it.
- 4
The digits of 51010 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51010 = 2 \times 5 \times 5101 \]
51010 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91836 |
| Euler totient φ(n) | 20400 |
| Square | 2602020100 |
| Cube | 132729045301000 |
| Square root | 225.853935 |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.101 × |
51010 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and ten |
| Binary (base 2) | 1100011101000010 |
| Octal (base 8) | 143502 |
| Hexadecimal (base 16) | C742 |
| Base 3 | 2120222021 |
| As time | 51010 seconds = 14 h 10 min 10 s |
Is 51010 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51010 ÷ 2 = 25505) | 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 | Yes (51010 ÷ 5 = 10202) | 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 1) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51010 ÷ 10 = 5101) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51010 a prime number?
No. 51010 = 2 × 5 × 5101, so it is divisible by 2.
What are the factors of 51010?
1, 2, 5, 10, 5101, 10202, 25505, 51010.
What is 51010 in binary?
1100011101000010 (hexadecimal C742, octal 143502).
What is the square root of 51010?
About 225.8539.
Is 51010 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 51010?
It is a composite number with 8 divisors.