The number 97681
97681 is a composite number with 8 divisors. Its prime factorisation is 23 × 31 × 137. Divisors (8): 1, 23, 31, 137, 713, 3151, 4247, 97681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 97681: a Harshad number: divisible by its digit sum 31.
- 2
97681 is composite. Its prime factorisation is
- 3
The divisors add up to 105984; without 97681 itself that is 8303, so 97681 is deficient (8303 is less than 97681). Euler's totient φ(97681) = 89760 numbers up to 97681 share no factor with it.
- 4
The digits of 97681 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 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97681 = 23 \times 31 \times 137 \]
97681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 105984 |
| Euler totient φ(n) | 89760 |
| Square | 9541577761 |
| Cube | 932030857272241 |
| Square root | 312.539597 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 102 |
| Scientific notation | 9.7681 × |
97681 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand six hundred and eighty-one |
| Binary (base 2) | 10111110110010001 |
| Octal (base 8) | 276621 |
| Hexadecimal (base 16) | 17D91 |
| Base 3 | 11221222211 |
| As time | 97681 seconds = 27 h 8 min 1 s |
Is 97681 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 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 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 97681 a prime number?
No. 97681 = 23 × 31 × 137, so it is divisible by 23.
What are the factors of 97681?
1, 23, 31, 137, 713, 3151, 4247, 97681.
What is 97681 in binary?
10111110110010001 (hexadecimal 17D91, octal 276621).
What is the square root of 97681?
About 312.5396.
Is 97681 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 97681?
97681 is a Harshad number: divisible by its digit sum 31.