The number 53150
53150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1063. Divisors (12): 1, 2, 5, 10, 25, 50, 1063, 2126, 5315, 10630, 26575, 53150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53150 is composite. Its prime factorisation is
- 3
The divisors add up to 98952; without 53150 itself that is 45802, so 53150 is deficient (45802 is less than 53150). Euler's totient φ(53150) = 21240 numbers up to 53150 share no factor with it.
- 4
The digits of 53150 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53150 = 2 \times 5^{2} \times 1063 \]53150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 98952 |
| Euler totient φ(n) | 21240 |
| Square | 2824922500 |
| Cube | 150144630875000 |
| Square root | 230.542838 (= 5√2126) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.315 × |
53150 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand one hundred and fifty |
| Binary (base 2) | 1100111110011110 |
| Octal (base 8) | 147636 |
| Hexadecimal (base 16) | CF9E |
| Base 3 | 2200220112 |
| As time | 53150 seconds = 14 h 45 min 50 s |
Is 53150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53150 ÷ 2 = 26575) | 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 (53150 ÷ 5 = 10630) | 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 6) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53150 ÷ 10 = 5315) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 53150 a prime number?
No. 53150 = 2 × × 1063, so it is divisible by 2.
What are the factors of 53150?
1, 2, 5, 10, 25, 50, 1063, 2126, 5315, 10630, 26575, 53150.
What is 53150 in binary?
1100111110011110 (hexadecimal CF9E, octal 147636).
What is the square root of 53150?
About 230.5428, exactly 5√2126.
Is 53150 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 53150?
It is a composite number with 12 divisors.