The number 56904
56904 is a composite number with 16 divisors. Its prime factorisation is × 3 × 2371. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 2371, 4742, 7113, 9484, 14226, 18968, 28452, 56904.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56904: a Harshad number: divisible by its digit sum 24.
- 2
56904 is composite. Its prime factorisation is
- 3
The divisors add up to 142320; without 56904 itself that is 85416, so 56904 is abundant (85416 is more than 56904). Euler's totient φ(56904) = 18960 numbers up to 56904 share no factor with it.
- 4
The digits of 56904 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56904 = 2^{3} \times 3 \times 2371 \]56904 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 142320 |
| Euler totient φ(n) | 18960 |
| Square | 3238065216 |
| Cube | 184258863051264 |
| Square root | 238.545593 (= 2√14226) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.6904 × |
56904 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and four |
| Binary (base 2) | 1101111001001000 |
| Octal (base 8) | 157110 |
| Hexadecimal (base 16) | DE48 |
| Base 3 | 2220001120 |
| As time | 56904 seconds = 15 h 48 min 24 s |
Is 56904 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56904 ÷ 2 = 28452) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56904 ÷ 3 = 18968) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56904 ÷ 4 = 14226) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (56904 ÷ 6 = 9484) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (56904 ÷ 8 = 7113) | 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 4) | 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 | Yes (56904 ÷ 12 = 4742) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56904 a prime number?
No. 56904 = × 3 × 2371, so it is divisible by 2.
What are the factors of 56904?
1, 2, 3, 4, 6, 8, 12, 24, 2371, 4742, 7113, 9484, 14226, 18968, 28452, 56904.
What is 56904 in binary?
1101111001001000 (hexadecimal DE48, octal 157110).
What is the square root of 56904?
About 238.5456, exactly 2√14226.
Is 56904 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 56904?
56904 is a Harshad number: divisible by its digit sum 24.