The number 51097
51097 is a composite number with 4 divisors. Its prime factorisation is 37 × 1381. Divisors (4): 1, 37, 1381, 51097.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51097: a semiprime: 37 × 1381, the product of two primes.
- 2
51097 is composite. Its prime factorisation is
- 3
The divisors add up to 52516; without 51097 itself that is 1419, so 51097 is deficient (1419 is less than 51097). Euler's totient φ(51097) = 49680 numbers up to 51097 share no factor with it.
- 4
The digits of 51097 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51097 = 37 \times 1381 \]
51097 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52516 |
| Euler totient φ(n) | 49680 |
| Square | 2610903409 |
| Cube | 133409331489673 |
| Square root | 226.046455 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1097 × |
51097 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and ninety-seven |
| Binary (base 2) | 1100011110011001 |
| Octal (base 8) | 143631 |
| Hexadecimal (base 16) | C799 |
| Base 3 | 2121002111 |
| As time | 51097 seconds = 14 h 11 min 37 s |
Is 51097 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 2) | 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 4) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 51097 a prime number?
No. 51097 = 37 × 1381, so it is divisible by 37.
What are the factors of 51097?
1, 37, 1381, 51097.
What is 51097 in binary?
1100011110011001 (hexadecimal C799, octal 143631).
What is the square root of 51097?
About 226.0465.
Is 51097 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 51097?
51097 is a semiprime: 37 × 1381, the product of two primes.