The number 57483
57483 is a composite number with 8 divisors. Its prime factorisation is × 2129. Divisors (8): 1, 3, 9, 27, 2129, 6387, 19161, 57483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57483: a Harshad number: divisible by its digit sum 27.
- 2
57483 is composite. Its prime factorisation is
- 3
The divisors add up to 85200; without 57483 itself that is 27717, so 57483 is deficient (27717 is less than 57483). Euler's totient φ(57483) = 38304 numbers up to 57483 share no factor with it.
- 4
The digits of 57483 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57483 = 3^{3} \times 2129 \]57483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 85200 |
| Euler totient φ(n) | 38304 |
| Square | 3304295289 |
| Cube | 189940806097587 |
| Square root | 239.756126 (= 3√6387) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.7483 × |
57483 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand four hundred and eighty-three |
| Binary (base 2) | 1110000010001011 |
| Octal (base 8) | 160213 |
| Hexadecimal (base 16) | E08B |
| Base 3 | 2220212000 |
| As time | 57483 seconds = 15 h 58 min 3 s |
Is 57483 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 (57483 ÷ 3 = 19161) | 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 3) | 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 | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (57483 ÷ 9 = 6387) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57483 a prime number?
No. 57483 = × 2129, so it is divisible by 3.
What are the factors of 57483?
1, 3, 9, 27, 2129, 6387, 19161, 57483.
What is 57483 in binary?
1110000010001011 (hexadecimal E08B, octal 160213).
What is the square root of 57483?
About 239.7561, exactly 3√6387.
Is 57483 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 57483?
57483 is a Harshad number: divisible by its digit sum 27.