The number 51089
51089 is a composite number with 4 divisors. Its prime factorisation is 47 × 1087. Divisors (4): 1, 47, 1087, 51089.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51089: a semiprime: 47 × 1087, the product of two primes.
- 2
51089 is composite. Its prime factorisation is
- 3
The divisors add up to 52224; without 51089 itself that is 1135, so 51089 is deficient (1135 is less than 51089). Euler's totient φ(51089) = 49956 numbers up to 51089 share no factor with it.
- 4
The digits of 51089 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51089 = 47 \times 1087 \]
51089 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52224 |
| Euler totient φ(n) | 49956 |
| Square | 2610085921 |
| Cube | 133346679617969 |
| Square root | 226.028759 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.1089 × |
51089 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and eighty-nine |
| Binary (base 2) | 1100011110010001 |
| Octal (base 8) | 143621 |
| Hexadecimal (base 16) | C791 |
| Base 3 | 2121002012 |
| As time | 51089 seconds = 14 h 11 min 29 s |
Is 51089 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 2) | 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 5) | 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 1) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51089 a prime number?
No. 51089 = 47 × 1087, so it is divisible by 47.
What are the factors of 51089?
1, 47, 1087, 51089.
What is 51089 in binary?
1100011110010001 (hexadecimal C791, octal 143621).
What is the square root of 51089?
About 226.0288.
Is 51089 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 51089?
51089 is a semiprime: 47 × 1087, the product of two primes.