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