The number 56040
56040 is a composite number with 32 divisors. Its prime factorisation is × 3 × 5 × 467. Divisors (32): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120 … 56040.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56040: a Harshad number: divisible by its digit sum 15.
- 2
56040 is composite. Its prime factorisation is
- 3
The divisors add up to 168480; without 56040 itself that is 112440, so 56040 is abundant (112440 is more than 56040). Euler's totient φ(56040) = 14912 numbers up to 56040 share no factor with it.
- 4
The digits of 56040 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56040 = 2^{3} \times 3 \times 5 \times 467 \]56040 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 168480 |
| Euler totient φ(n) | 14912 |
| Square | 3140481600 |
| Cube | 175992588864000 |
| Square root | 236.727692 (= 2√14010) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.604 × |
56040 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and forty |
| Binary (base 2) | 1101101011101000 |
| Octal (base 8) | 155350 |
| Hexadecimal (base 16) | DAE8 |
| Base 3 | 2211212120 |
| As time | 56040 seconds = 15 h 34 min 0 s |
Is 56040 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56040 ÷ 2 = 28020) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56040 ÷ 3 = 18680) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56040 ÷ 4 = 14010) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (56040 ÷ 5 = 11208) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (56040 ÷ 6 = 9340) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (56040 ÷ 8 = 7005) | 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 | Yes (56040 ÷ 10 = 5604) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (56040 ÷ 12 = 4670) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56040 a prime number?
No. 56040 = × 3 × 5 × 467, so it is divisible by 2.
What are the factors of 56040?
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120, 467, 934, 1401, 1868, 2335, 2802, 3736, 4670, 5604, 7005, 9340, 11208, 14010, 18680, 28020, 56040.
What is 56040 in binary?
1101101011101000 (hexadecimal DAE8, octal 155350).
What is the square root of 56040?
About 236.7277, exactly 2√14010.
Is 56040 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 56040?
56040 is a Harshad number: divisible by its digit sum 15.