The number 97671
97671 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 4651. Divisors (8): 1, 3, 7, 21, 4651, 13953, 32557, 97671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
97671 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
97671 is composite. Its prime factorisation is
- 3
The divisors add up to 148864; without 97671 itself that is 51193, so 97671 is deficient (51193 is less than 97671). Euler's totient φ(97671) = 55800 numbers up to 97671 share no factor with it.
- 4
The digits of 97671 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97671 = 3 \times 7 \times 4651 \]
97671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 148864 |
| Euler totient φ(n) | 55800 |
| Square | 9539624241 |
| Cube | 931744639242711 |
| Square root | 312.523599 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 159 |
| Scientific notation | 9.7671 × |
97671 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand six hundred and seventy-one |
| Binary (base 2) | 10111110110000111 |
| Octal (base 8) | 276607 |
| Hexadecimal (base 16) | 17D87 |
| Base 3 | 11221222110 |
| As time | 97671 seconds = 27 h 7 min 51 s |
Is 97671 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 | Yes (97671 ÷ 3 = 32557) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (97671 ÷ 7 = 13953) | 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 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 97671 a prime number?
No. 97671 = 3 × 7 × 4651, so it is divisible by 3.
What are the factors of 97671?
1, 3, 7, 21, 4651, 13953, 32557, 97671.
What is 97671 in binary?
10111110110000111 (hexadecimal 17D87, octal 276607).
What is the square root of 97671?
About 312.5236.
Is 97671 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 97671?
It is a composite number with 8 divisors.