The number 53487
53487 is a composite number with 16 divisors. Its prime factorisation is × 7 × 283. Divisors (16): 1, 3, 7, 9, 21, 27, 63, 189, 283, 849, 1981, 2547, 5943, 7641, 17829, 53487.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53487: a Harshad number: divisible by its digit sum 27.
- 2
53487 is composite. Its prime factorisation is
- 3
The divisors add up to 90880; without 53487 itself that is 37393, so 53487 is deficient (37393 is less than 53487). Euler's totient φ(53487) = 30456 numbers up to 53487 share no factor with it.
- 4
The digits of 53487 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53487 = 3^{3} \times 7 \times 283 \]53487 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 90880 |
| Euler totient φ(n) | 30456 |
| Square | 2860859169 |
| Cube | 153018774372303 |
| Square root | 231.272566 (= 3√5943) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.3487 × |
53487 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and eighty-seven |
| Binary (base 2) | 1101000011101111 |
| Octal (base 8) | 150357 |
| Hexadecimal (base 16) | D0EF |
| Base 3 | 2201101000 |
| As time | 53487 seconds = 14 h 51 min 27 s |
Is 53487 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (53487 ÷ 3 = 17829) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (53487 ÷ 7 = 7641) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (53487 ÷ 9 = 5943) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53487 a prime number?
No. 53487 = × 7 × 283, so it is divisible by 3.
What are the factors of 53487?
1, 3, 7, 9, 21, 27, 63, 189, 283, 849, 1981, 2547, 5943, 7641, 17829, 53487.
What is 53487 in binary?
1101000011101111 (hexadecimal D0EF, octal 150357).
What is the square root of 53487?
About 231.2726, exactly 3√5943.
Is 53487 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 53487?
53487 is a Harshad number: divisible by its digit sum 27.