The number 97465
97465 is a composite number with 8 divisors. Its prime factorisation is 5 × 101 × 193. Divisors (8): 1, 5, 101, 193, 505, 965, 19493, 97465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
97465 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
97465 is composite. Its prime factorisation is
- 3
The divisors add up to 118728; without 97465 itself that is 21263, so 97465 is deficient (21263 is less than 97465). Euler's totient φ(97465) = 76800 numbers up to 97465 share no factor with it.
- 4
The digits of 97465 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 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97465 = 5 \times 101 \times 193 \]
97465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 118728 |
| Euler totient φ(n) | 76800 |
| Square | 9499426225 |
| Cube | 925861577019625 |
| Square root | 312.193850 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 159 |
| Scientific notation | 9.7465 × |
97465 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand four hundred and sixty-five |
| Binary (base 2) | 10111110010111001 |
| Octal (base 8) | 276271 |
| Hexadecimal (base 16) | 17CB9 |
| Base 3 | 11221200211 |
| As time | 97465 seconds = 27 h 4 min 25 s |
Is 97465 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 | Yes (97465 ÷ 5 = 19493) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 97465 a prime number?
No. 97465 = 5 × 101 × 193, so it is divisible by 5.
What are the factors of 97465?
1, 5, 101, 193, 505, 965, 19493, 97465.
What is 97465 in binary?
10111110010111001 (hexadecimal 17CB9, octal 276271).
What is the square root of 97465?
About 312.1939.
Is 97465 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 97465?
It is a composite number with 8 divisors.