The number 56090
56090 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 71 × 79. Divisors (16): 1, 2, 5, 10, 71, 79, 142, 158, 355, 395, 710, 790, 5609, 11218, 28045, 56090.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56090 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56090 is composite. Its prime factorisation is
- 3
The divisors add up to 103680; without 56090 itself that is 47590, so 56090 is deficient (47590 is less than 56090). Euler's totient φ(56090) = 21840 numbers up to 56090 share no factor with it.
- 4
The digits of 56090 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56090 = 2 \times 5 \times 71 \times 79 \]
56090 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 103680 |
| Euler totient φ(n) | 21840 |
| Square | 3146088100 |
| Cube | 176464081529000 |
| Square root | 236.833275 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.609 × |
56090 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and ninety |
| Binary (base 2) | 1101101100011010 |
| Octal (base 8) | 155432 |
| Hexadecimal (base 16) | DB1A |
| Base 3 | 2211221102 |
| As time | 56090 seconds = 15 h 34 min 50 s |
Is 56090 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56090 ÷ 2 = 28045) | 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 (56090 ÷ 5 = 11218) | 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 6) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (56090 ÷ 10 = 5609) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 56090 a prime number?
No. 56090 = 2 × 5 × 71 × 79, so it is divisible by 2.
What are the factors of 56090?
1, 2, 5, 10, 71, 79, 142, 158, 355, 395, 710, 790, 5609, 11218, 28045, 56090.
What is 56090 in binary?
1101101100011010 (hexadecimal DB1A, octal 155432).
What is the square root of 56090?
About 236.8333.
Is 56090 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 56090?
It is a composite number with 16 divisors.