The number 97051
97051 is a composite number with 8 divisors. Its prime factorisation is 37 × 43 × 61. Divisors (8): 1, 37, 43, 61, 1591, 2257, 2623, 97051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
97051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
97051 is composite. Its prime factorisation is
- 3
The divisors add up to 103664; without 97051 itself that is 6613, so 97051 is deficient (6613 is less than 97051). Euler's totient φ(97051) = 90720 numbers up to 97051 share no factor with it.
- 4
The digits of 97051 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 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97051 = 37 \times 43 \times 61 \]
97051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 103664 |
| Euler totient φ(n) | 90720 |
| Square | 9418896601 |
| Cube | 914113334023651 |
| Square root | 311.530095 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 128 |
| Scientific notation | 9.7051 × |
97051 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand and fifty-one |
| Binary (base 2) | 10111101100011011 |
| Octal (base 8) | 275433 |
| Hexadecimal (base 16) | 17B1B |
| Base 3 | 11221010111 |
| As time | 97051 seconds = 26 h 57 min 31 s |
Is 97051 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 97051 a prime number?
No. 97051 = 37 × 43 × 61, so it is divisible by 37.
What are the factors of 97051?
1, 37, 43, 61, 1591, 2257, 2623, 97051.
What is 97051 in binary?
10111101100011011 (hexadecimal 17B1B, octal 275433).
What is the square root of 97051?
About 311.5301.
Is 97051 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 97051?
It is a composite number with 8 divisors.