The number 98761
98761 is a composite number with 8 divisors. Its prime factorisation is 13 × 71 × 107. Divisors (8): 1, 13, 71, 107, 923, 1391, 7597, 98761.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
98761 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
98761 is composite. Its prime factorisation is
- 3
The divisors add up to 108864; without 98761 itself that is 10103, so 98761 is deficient (10103 is less than 98761). Euler's totient φ(98761) = 89040 numbers up to 98761 share no factor with it.
- 4
The digits of 98761 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 98761 = 13 \times 71 \times 107 \]
98761 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 108864 |
| Euler totient φ(n) | 89040 |
| Square | 9753735121 |
| Cube | 963288634285081 |
| Square root | 314.262629 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.8761 × |
98761 in other forms
| Form | Value |
|---|---|
| In words | ninety-eight thousand seven hundred and sixty-one |
| Binary (base 2) | 11000000111001001 |
| Octal (base 8) | 300711 |
| Hexadecimal (base 16) | 181C9 |
| Base 3 | 12000110211 |
| As time | 98761 seconds = 27 h 26 min 1 s |
Is 98761 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 5) | 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 3) | 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 98761 a prime number?
No. 98761 = 13 × 71 × 107, so it is divisible by 13.
What are the factors of 98761?
1, 13, 71, 107, 923, 1391, 7597, 98761.
What is 98761 in binary?
11000000111001001 (hexadecimal 181C9, octal 300711).
What is the square root of 98761?
About 314.2626.
Is 98761 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 98761?
It is a composite number with 8 divisors.