The number 51014
51014 is a composite number with 8 divisors. Its prime factorisation is 2 × 23 × 1109. Divisors (8): 1, 2, 23, 46, 1109, 2218, 25507, 51014.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51014 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51014 is composite. Its prime factorisation is
- 3
The divisors add up to 79920; without 51014 itself that is 28906, so 51014 is deficient (28906 is less than 51014). Euler's totient φ(51014) = 24376 numbers up to 51014 share no factor with it.
- 4
The digits of 51014 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51014 = 2 \times 23 \times 1109 \]
51014 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79920 |
| Euler totient φ(n) | 24376 |
| Square | 2602428196 |
| Cube | 132760271990744 |
| Square root | 225.862790 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1014 × |
51014 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and fourteen |
| Binary (base 2) | 1100011101000110 |
| Octal (base 8) | 143506 |
| Hexadecimal (base 16) | C746 |
| Base 3 | 2120222102 |
| As time | 51014 seconds = 14 h 10 min 14 s |
Is 51014 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51014 ÷ 2 = 25507) | 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 4) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 7) | 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 51014 a prime number?
No. 51014 = 2 × 23 × 1109, so it is divisible by 2.
What are the factors of 51014?
1, 2, 23, 46, 1109, 2218, 25507, 51014.
What is 51014 in binary?
1100011101000110 (hexadecimal C746, octal 143506).
What is the square root of 51014?
About 225.8628.
Is 51014 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 51014?
It is a composite number with 8 divisors.