The number 97502
97502 is a composite number with 4 divisors. Its prime factorisation is 2 × 48751. Divisors (4): 1, 2, 48751, 97502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 97502: a semiprime: 2 × 48751, the product of two primes.
- 2
97502 is composite. Its prime factorisation is
- 3
The divisors add up to 146256; without 97502 itself that is 48754, so 97502 is deficient (48754 is less than 97502). Euler's totient φ(97502) = 48750 numbers up to 97502 share no factor with it.
- 4
The digits of 97502 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97502 = 2 \times 48751 \]
97502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 146256 |
| Euler totient φ(n) | 48750 |
| Square | 9506640004 |
| Cube | 926916413670008 |
| Square root | 312.253102 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.7502 × |
97502 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand five hundred and two |
| Binary (base 2) | 10111110011011110 |
| Octal (base 8) | 276336 |
| Hexadecimal (base 16) | 17CDE |
| Base 3 | 11221202012 |
| As time | 97502 seconds = 27 h 5 min 2 s |
Is 97502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (97502 ÷ 2 = 48751) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 97502 a prime number?
No. 97502 = 2 × 48751, so it is divisible by 2.
What are the factors of 97502?
1, 2, 48751, 97502.
What is 97502 in binary?
10111110011011110 (hexadecimal 17CDE, octal 276336).
What is the square root of 97502?
About 312.2531.
Is 97502 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 97502?
97502 is a semiprime: 2 × 48751, the product of two primes.