The number 53500
53500 is a composite number with 24 divisors. Its prime factorisation is × × 107. Divisors (24): 1, 2, 4, 5, 10, 20, 25, 50, 100, 107, 125, 214, 250, 428, 500, 535 … 53500.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53500 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53500 is composite. Its prime factorisation is
- 3
The divisors add up to 117936; without 53500 itself that is 64436, so 53500 is abundant (64436 is more than 53500). Euler's totient φ(53500) = 21200 numbers up to 53500 share no factor with it.
- 4
The digits of 53500 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53500 = 2^{2} \times 5^{3} \times 107 \]53500 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 117936 |
| Euler totient φ(n) | 21200 |
| Square | 2862250000 |
| Cube | 153130375000000 |
| Square root | 231.300670 (= 10√535) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.35 × |
53500 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand five hundred |
| Binary (base 2) | 1101000011111100 |
| Octal (base 8) | 150374 |
| Hexadecimal (base 16) | D0FC |
| Base 3 | 2201101111 |
| As time | 53500 seconds = 14 h 51 min 40 s |
Is 53500 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53500 ÷ 2 = 26750) | 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 | Yes (53500 ÷ 4 = 13375) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (53500 ÷ 5 = 10700) | 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 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 4) | 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 (53500 ÷ 10 = 5350) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53500 a prime number?
No. 53500 = × × 107, so it is divisible by 2.
What are the factors of 53500?
1, 2, 4, 5, 10, 20, 25, 50, 100, 107, 125, 214, 250, 428, 500, 535, 1070, 2140, 2675, 5350, 10700, 13375, 26750, 53500.
What is 53500 in binary?
1101000011111100 (hexadecimal D0FC, octal 150374).
What is the square root of 53500?
About 231.3007, exactly 10√535.
Is 53500 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 53500?
It is a composite number with 24 divisors.