The number 56150
56150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1123. Divisors (12): 1, 2, 5, 10, 25, 50, 1123, 2246, 5615, 11230, 28075, 56150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56150 is composite. Its prime factorisation is
- 3
The divisors add up to 104532; without 56150 itself that is 48382, so 56150 is deficient (48382 is less than 56150). Euler's totient φ(56150) = 22440 numbers up to 56150 share no factor with it.
- 4
The digits of 56150 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56150 = 2 \times 5^{2} \times 1123 \]56150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 104532 |
| Euler totient φ(n) | 22440 |
| Square | 3152822500 |
| Cube | 177030983375000 |
| Square root | 236.959912 (= 5√2246) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.615 × |
56150 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand one hundred and fifty |
| Binary (base 2) | 1101101101010110 |
| Octal (base 8) | 155526 |
| Hexadecimal (base 16) | DB56 |
| Base 3 | 2212000122 |
| As time | 56150 seconds = 15 h 35 min 50 s |
Is 56150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56150 ÷ 2 = 28075) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (56150 ÷ 5 = 11230) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (56150 ÷ 10 = 5615) | 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 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56150 a prime number?
No. 56150 = 2 × × 1123, so it is divisible by 2.
What are the factors of 56150?
1, 2, 5, 10, 25, 50, 1123, 2246, 5615, 11230, 28075, 56150.
What is 56150 in binary?
1101101101010110 (hexadecimal DB56, octal 155526).
What is the square root of 56150?
About 236.9599, exactly 5√2246.
Is 56150 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 56150?
It is a composite number with 12 divisors.