The number 56268
56268 is a composite number with 24 divisors. Its prime factorisation is × × 521. Divisors (24): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 521, 1042, 1563, 2084 … 56268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56268: a Harshad number: divisible by its digit sum 27.
- 2
56268 is composite. Its prime factorisation is
- 3
The divisors add up to 146160; without 56268 itself that is 89892, so 56268 is abundant (89892 is more than 56268). Euler's totient φ(56268) = 18720 numbers up to 56268 share no factor with it.
- 4
The digits of 56268 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56268 = 2^{2} \times 3^{3} \times 521 \]56268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 146160 |
| Euler totient φ(n) | 18720 |
| Square | 3166087824 |
| Cube | 178149429680832 |
| Square root | 237.208769 (= 6√1563) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.6268 × |
56268 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand two hundred and sixty-eight |
| Binary (base 2) | 1101101111001100 |
| Octal (base 8) | 155714 |
| Hexadecimal (base 16) | DBCC |
| Base 3 | 2212012000 |
| As time | 56268 seconds = 15 h 37 min 48 s |
Is 56268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56268 ÷ 2 = 28134) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56268 ÷ 3 = 18756) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56268 ÷ 4 = 14067) | 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 (56268 ÷ 6 = 9378) | 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 | Yes (56268 ÷ 9 = 6252) | 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 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (56268 ÷ 12 = 4689) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56268 a prime number?
No. 56268 = × × 521, so it is divisible by 2.
What are the factors of 56268?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 521, 1042, 1563, 2084, 3126, 4689, 6252, 9378, 14067, 18756, 28134, 56268.
What is 56268 in binary?
1101101111001100 (hexadecimal DBCC, octal 155714).
What is the square root of 56268?
About 237.2088, exactly 6√1563.
Is 56268 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56268?
56268 is a Harshad number: divisible by its digit sum 27.