The number 56460
56460 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 941. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 941, 1882, 2823, 3764 … 56460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56460 is composite. Its prime factorisation is
- 3
The divisors add up to 158256; without 56460 itself that is 101796, so 56460 is abundant (101796 is more than 56460). Euler's totient φ(56460) = 15040 numbers up to 56460 share no factor with it.
- 4
The digits of 56460 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56460 = 2^{2} \times 3 \times 5 \times 941 \]56460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 158256 |
| Euler totient φ(n) | 15040 |
| Square | 3187731600 |
| Cube | 179979326136000 |
| Square root | 237.613131 (= 2√14115) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.646 × |
56460 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand four hundred and sixty |
| Binary (base 2) | 1101110010001100 |
| Octal (base 8) | 156214 |
| Hexadecimal (base 16) | DC8C |
| Base 3 | 2212110010 |
| As time | 56460 seconds = 15 h 41 min 0 s |
Is 56460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56460 ÷ 2 = 28230) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56460 ÷ 3 = 18820) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56460 ÷ 4 = 14115) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (56460 ÷ 5 = 11292) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (56460 ÷ 6 = 9410) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (56460 ÷ 10 = 5646) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (56460 ÷ 12 = 4705) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56460 a prime number?
No. 56460 = × 3 × 5 × 941, so it is divisible by 2.
What are the factors of 56460?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 941, 1882, 2823, 3764, 4705, 5646, 9410, 11292, 14115, 18820, 28230, 56460.
What is 56460 in binary?
1101110010001100 (hexadecimal DC8C, octal 156214).
What is the square root of 56460?
About 237.6131, exactly 2√14115.
Is 56460 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 56460?
It is a composite number with 24 divisors.