The number 53490
53490 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1783. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1783, 3566, 5349, 8915, 10698, 17830, 26745, 53490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53490 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53490 is composite. Its prime factorisation is
- 3
The divisors add up to 128448; without 53490 itself that is 74958, so 53490 is abundant (74958 is more than 53490). Euler's totient φ(53490) = 14256 numbers up to 53490 share no factor with it.
- 4
The digits of 53490 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53490 = 2 \times 3 \times 5 \times 1783 \]
53490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 128448 |
| Euler totient φ(n) | 14256 |
| Square | 2861180100 |
| Cube | 153044523549000 |
| Square root | 231.279052 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.349 × |
53490 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and ninety |
| Binary (base 2) | 1101000011110010 |
| Octal (base 8) | 150362 |
| Hexadecimal (base 16) | D0F2 |
| Base 3 | 2201101010 |
| As time | 53490 seconds = 14 h 51 min 30 s |
Is 53490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53490 ÷ 2 = 26745) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (53490 ÷ 3 = 17830) | 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 (53490 ÷ 5 = 10698) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (53490 ÷ 6 = 8915) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53490 ÷ 10 = 5349) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53490 a prime number?
No. 53490 = 2 × 3 × 5 × 1783, so it is divisible by 2.
What are the factors of 53490?
1, 2, 3, 5, 6, 10, 15, 30, 1783, 3566, 5349, 8915, 10698, 17830, 26745, 53490.
What is 53490 in binary?
1101000011110010 (hexadecimal D0F2, octal 150362).
What is the square root of 53490?
About 231.2791.
Is 53490 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 53490?
It is a composite number with 16 divisors.