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