The number 57476
57476 is a composite number with 6 divisors. Its prime factorisation is × 14369. Divisors (6): 1, 2, 4, 14369, 28738, 57476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57476 is composite. Its prime factorisation is
- 3
The divisors add up to 100590; without 57476 itself that is 43114, so 57476 is deficient (43114 is less than 57476). Euler's totient φ(57476) = 28736 numbers up to 57476 share no factor with it.
- 4
The digits of 57476 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57476 = 2^{2} \times 14369 \]57476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 100590 |
| Euler totient φ(n) | 28736 |
| Square | 3303490576 |
| Cube | 189871424346176 |
| Square root | 239.741527 (= 2√14369) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.7476 × |
57476 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand four hundred and seventy-six |
| Binary (base 2) | 1110000010000100 |
| Octal (base 8) | 160204 |
| Hexadecimal (base 16) | E084 |
| Base 3 | 2220211202 |
| As time | 57476 seconds = 15 h 57 min 56 s |
Is 57476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57476 ÷ 2 = 28738) | 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 | Yes (57476 ÷ 4 = 14369) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57476 a prime number?
No. 57476 = × 14369, so it is divisible by 2.
What are the factors of 57476?
1, 2, 4, 14369, 28738, 57476.
What is 57476 in binary?
1110000010000100 (hexadecimal E084, octal 160204).
What is the square root of 57476?
About 239.7415, exactly 2√14369.
Is 57476 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 57476?
It is a composite number with 6 divisors.