The number 53330
53330 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5333. Divisors (8): 1, 2, 5, 10, 5333, 10666, 26665, 53330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53330 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53330 is composite. Its prime factorisation is
- 3
The divisors add up to 96012; without 53330 itself that is 42682, so 53330 is deficient (42682 is less than 53330). Euler's totient φ(53330) = 21328 numbers up to 53330 share no factor with it.
- 4
The digits of 53330 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53330 = 2 \times 5 \times 5333 \]
53330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 96012 |
| Euler totient φ(n) | 21328 |
| Square | 2844088900 |
| Cube | 151675261037000 |
| Square root | 230.932891 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 70 |
| Scientific notation | 5.333 × |
53330 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand three hundred and thirty |
| Binary (base 2) | 1101000001010010 |
| Octal (base 8) | 150122 |
| Hexadecimal (base 16) | D052 |
| Base 3 | 2201011012 |
| As time | 53330 seconds = 14 h 48 min 50 s |
Is 53330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53330 ÷ 2 = 26665) | 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 (53330 ÷ 5 = 10666) | 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 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53330 ÷ 10 = 5333) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 53330 a prime number?
No. 53330 = 2 × 5 × 5333, so it is divisible by 2.
What are the factors of 53330?
1, 2, 5, 10, 5333, 10666, 26665, 53330.
What is 53330 in binary?
1101000001010010 (hexadecimal D052, octal 150122).
What is the square root of 53330?
About 230.9329.
Is 53330 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 53330?
It is a composite number with 8 divisors.