The number 97951
97951 is a composite number with 6 divisors. Its prime factorisation is Ć 1999. Divisors (6): 1, 7, 49, 1999, 13993, 97951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
97951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
97951 is composite. Its prime factorisation is
- 3
The divisors add up to 114000; without 97951 itself that is 16049, so 97951 is deficient (16049 is less than 97951). Euler's totient Ļ(97951) = 83916 numbers up to 97951 share no factor with it.
- 4
The digits of 97951 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97951 = 7^{2} \times 1999 \]97951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 114000 |
| Euler totient Ļ(n) | 83916 |
| Square | 9594398401 |
| Cube | 939780917776351 |
| Square root | 312.971245 (= 7ā1999) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.7951 Ć |
97951 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand nine hundred and fifty-one |
| Binary (base 2) | 10111111010011111 |
| Octal (base 8) | 277237 |
| Hexadecimal (base 16) | 17E9F |
| Base 3 | 11222100211 |
| As time | 97951 seconds = 27 h 12 min 31 s |
Is 97951 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 | Yes (97951 Ć· 7 = 13993) | 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 7) | 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 7) | 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 97951 a prime number?
No. 97951 = Ć 1999, so it is divisible by 7.
What are the factors of 97951?
1, 7, 49, 1999, 13993, 97951.
What is 97951 in binary?
10111111010011111 (hexadecimal 17E9F, octal 277237).
What is the square root of 97951?
About 312.9712, exactly 7ā1999.
Is 97951 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 97951?
It is a composite number with 6 divisors.