The number 57948
57948 is a composite number with 24 divisors. Its prime factorisation is × 3 × 11 × 439. Divisors (24): 1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 132, 439, 878, 1317, 1756 … 57948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57948: a Harshad number: divisible by its digit sum 33.
- 2
57948 is composite. Its prime factorisation is
- 3
The divisors add up to 147840; without 57948 itself that is 89892, so 57948 is abundant (89892 is more than 57948). Euler's totient φ(57948) = 17520 numbers up to 57948 share no factor with it.
- 4
The digits of 57948 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57948 = 2^{2} \times 3 \times 11 \times 439 \]57948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 147840 |
| Euler totient φ(n) | 17520 |
| Square | 3357970704 |
| Cube | 194587686355392 |
| Square root | 240.723908 (= 2√14487) |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.7948 × |
57948 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand nine hundred and forty-eight |
| Binary (base 2) | 1110001001011100 |
| Octal (base 8) | 161134 |
| Hexadecimal (base 16) | E25C |
| Base 3 | 2221111020 |
| As time | 57948 seconds = 16 h 5 min 48 s |
Is 57948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57948 ÷ 2 = 28974) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (57948 ÷ 3 = 19316) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (57948 ÷ 4 = 14487) | 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 | Yes (57948 ÷ 6 = 9658) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (57948 ÷ 11 = 5268) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (57948 ÷ 12 = 4829) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57948 a prime number?
No. 57948 = × 3 × 11 × 439, so it is divisible by 2.
What are the factors of 57948?
1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 132, 439, 878, 1317, 1756, 2634, 4829, 5268, 9658, 14487, 19316, 28974, 57948.
What is 57948 in binary?
1110001001011100 (hexadecimal E25C, octal 161134).
What is the square root of 57948?
About 240.7239, exactly 2√14487.
Is 57948 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 57948?
57948 is a Harshad number: divisible by its digit sum 33.