The number 53050
53050 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1061. Divisors (12): 1, 2, 5, 10, 25, 50, 1061, 2122, 5305, 10610, 26525, 53050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53050 is composite. Its prime factorisation is
- 3
The divisors add up to 98766; without 53050 itself that is 45716, so 53050 is deficient (45716 is less than 53050). Euler's totient φ(53050) = 21200 numbers up to 53050 share no factor with it.
- 4
The digits of 53050 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53050 = 2 \times 5^{2} \times 1061 \]53050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 98766 |
| Euler totient φ(n) | 21200 |
| Square | 2814302500 |
| Cube | 149298747625000 |
| Square root | 230.325856 (= 5√2122) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.305 × |
53050 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and fifty |
| Binary (base 2) | 1100111100111010 |
| Octal (base 8) | 147472 |
| Hexadecimal (base 16) | CF3A |
| Base 3 | 2200202211 |
| As time | 53050 seconds = 14 h 44 min 10 s |
Is 53050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53050 ÷ 2 = 26525) | 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 (53050 ÷ 5 = 10610) | 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 4) | 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 (53050 ÷ 10 = 5305) | 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 53050 a prime number?
No. 53050 = 2 × × 1061, so it is divisible by 2.
What are the factors of 53050?
1, 2, 5, 10, 25, 50, 1061, 2122, 5305, 10610, 26525, 53050.
What is 53050 in binary?
1100111100111010 (hexadecimal CF3A, octal 147472).
What is the square root of 53050?
About 230.3259, exactly 5√2122.
Is 53050 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 53050?
It is a composite number with 12 divisors.