The number 56089
56089 is a composite number with 4 divisors. Its prime factorisation is 11 × 5099. Divisors (4): 1, 11, 5099, 56089.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56089: a semiprime: 11 × 5099, the product of two primes.
- 2
56089 is composite. Its prime factorisation is
- 3
The divisors add up to 61200; without 56089 itself that is 5111, so 56089 is deficient (5111 is less than 56089). Euler's totient φ(56089) = 50980 numbers up to 56089 share no factor with it.
- 4
The digits of 56089 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56089 = 11 \times 5099 \]
56089 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61200 |
| Euler totient φ(n) | 50980 |
| Square | 3145975921 |
| Cube | 176454643432969 |
| Square root | 236.831163 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6089 × |
56089 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and eighty-nine |
| Binary (base 2) | 1101101100011001 |
| Octal (base 8) | 155431 |
| Hexadecimal (base 16) | DB19 |
| Base 3 | 2211221101 |
| As time | 56089 seconds = 15 h 34 min 49 s |
Is 56089 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56089 ÷ 11 = 5099) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56089 a prime number?
No. 56089 = 11 × 5099, so it is divisible by 11.
What are the factors of 56089?
1, 11, 5099, 56089.
What is 56089 in binary?
1101101100011001 (hexadecimal DB19, octal 155431).
What is the square root of 56089?
About 236.8312.
Is 56089 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 56089?
56089 is a semiprime: 11 × 5099, the product of two primes.