The number 56390
56390 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5639. Divisors (8): 1, 2, 5, 10, 5639, 11278, 28195, 56390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56390 is composite. Its prime factorisation is
- 3
The divisors add up to 101520; without 56390 itself that is 45130, so 56390 is deficient (45130 is less than 56390). Euler's totient φ(56390) = 22552 numbers up to 56390 share no factor with it.
- 4
The digits of 56390 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56390 = 2 \times 5 \times 5639 \]
56390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 101520 |
| Euler totient φ(n) | 22552 |
| Square | 3179832100 |
| Cube | 179310732119000 |
| Square root | 237.465787 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.639 × |
56390 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand three hundred and ninety |
| Binary (base 2) | 1101110001000110 |
| Octal (base 8) | 156106 |
| Hexadecimal (base 16) | DC46 |
| Base 3 | 2212100112 |
| As time | 56390 seconds = 15 h 39 min 50 s |
Is 56390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56390 ÷ 2 = 28195) | 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 (56390 ÷ 5 = 11278) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (56390 ÷ 10 = 5639) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 56390 a prime number?
No. 56390 = 2 × 5 × 5639, so it is divisible by 2.
What are the factors of 56390?
1, 2, 5, 10, 5639, 11278, 28195, 56390.
What is 56390 in binary?
1101110001000110 (hexadecimal DC46, octal 156106).
What is the square root of 56390?
About 237.4658.
Is 56390 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 56390?
It is a composite number with 8 divisors.