The number 98962
98962 is a composite number with 4 divisors. Its prime factorisation is 2 × 49481. Divisors (4): 1, 2, 49481, 98962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 98962: a semiprime: 2 × 49481, the product of two primes.
- 2
98962 is composite. Its prime factorisation is
- 3
The divisors add up to 148446; without 98962 itself that is 49484, so 98962 is deficient (49484 is less than 98962). Euler's totient φ(98962) = 49480 numbers up to 98962 share no factor with it.
- 4
The digits of 98962 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 98962 = 2 \times 49481 \]
98962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 148446 |
| Euler totient φ(n) | 49480 |
| Square | 9793477444 |
| Cube | 969182114813128 |
| Square root | 314.582263 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.8962 × |
98962 in other forms
| Form | Value |
|---|---|
| In words | ninety-eight thousand nine hundred and sixty-two |
| Binary (base 2) | 11000001010010010 |
| Octal (base 8) | 301222 |
| Hexadecimal (base 16) | 18292 |
| Base 3 | 12000202021 |
| As time | 98962 seconds = 27 h 29 min 22 s |
Is 98962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (98962 ÷ 2 = 49481) | 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 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 98962 a prime number?
No. 98962 = 2 × 49481, so it is divisible by 2.
What are the factors of 98962?
1, 2, 49481, 98962.
What is 98962 in binary?
11000001010010010 (hexadecimal 18292, octal 301222).
What is the square root of 98962?
About 314.5823.
Is 98962 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 98962?
98962 is a semiprime: 2 × 49481, the product of two primes.