The number 51070
51070 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5107. Divisors (8): 1, 2, 5, 10, 5107, 10214, 25535, 51070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51070 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51070 is composite. Its prime factorisation is
- 3
The divisors add up to 91944; without 51070 itself that is 40874, so 51070 is deficient (40874 is less than 51070). Euler's totient φ(51070) = 20424 numbers up to 51070 share no factor with it.
- 4
The digits of 51070 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51070 = 2 \times 5 \times 5107 \]
51070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91944 |
| Euler totient φ(n) | 20424 |
| Square | 2608144900 |
| Cube | 133197960043000 |
| Square root | 225.986725 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.107 × |
51070 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and seventy |
| Binary (base 2) | 1100011101111110 |
| Octal (base 8) | 143576 |
| Hexadecimal (base 16) | C77E |
| Base 3 | 2121001111 |
| As time | 51070 seconds = 14 h 11 min 10 s |
Is 51070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51070 ÷ 2 = 25535) | 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 (51070 ÷ 5 = 10214) | 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 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51070 ÷ 10 = 5107) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 51070 a prime number?
No. 51070 = 2 × 5 × 5107, so it is divisible by 2.
What are the factors of 51070?
1, 2, 5, 10, 5107, 10214, 25535, 51070.
What is 51070 in binary?
1100011101111110 (hexadecimal C77E, octal 143576).
What is the square root of 51070?
About 225.9867.
Is 51070 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 51070?
It is a composite number with 8 divisors.