The number 56130
56130 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1871. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1871, 3742, 5613, 9355, 11226, 18710, 28065, 56130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56130: a Harshad number: divisible by its digit sum 15.
- 2
56130 is composite. Its prime factorisation is
- 3
The divisors add up to 134784; without 56130 itself that is 78654, so 56130 is abundant (78654 is more than 56130). Euler's totient φ(56130) = 14960 numbers up to 56130 share no factor with it.
- 4
The digits of 56130 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 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56130 = 2 \times 3 \times 5 \times 1871 \]
56130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 134784 |
| Euler totient φ(n) | 14960 |
| Square | 3150576900 |
| Cube | 176841881397000 |
| Square root | 236.917707 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.613 × |
56130 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand one hundred and thirty |
| Binary (base 2) | 1101101101000010 |
| Octal (base 8) | 155502 |
| Hexadecimal (base 16) | DB42 |
| Base 3 | 2211222220 |
| As time | 56130 seconds = 15 h 35 min 30 s |
Is 56130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56130 ÷ 2 = 28065) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56130 ÷ 3 = 18710) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (56130 ÷ 5 = 11226) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (56130 ÷ 6 = 9355) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 (56130 ÷ 10 = 5613) | 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 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56130 a prime number?
No. 56130 = 2 × 3 × 5 × 1871, so it is divisible by 2.
What are the factors of 56130?
1, 2, 3, 5, 6, 10, 15, 30, 1871, 3742, 5613, 9355, 11226, 18710, 28065, 56130.
What is 56130 in binary?
1101101101000010 (hexadecimal DB42, octal 155502).
What is the square root of 56130?
About 236.9177.
Is 56130 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 56130?
56130 is a Harshad number: divisible by its digit sum 15.