The number 99962
99962 is a composite number with 8 divisors. Its prime factorisation is 2 × 151 × 331. Divisors (8): 1, 2, 151, 302, 331, 662, 49981, 99962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
99962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
99962 is composite. Its prime factorisation is
- 3
The divisors add up to 151392; without 99962 itself that is 51430, so 99962 is deficient (51430 is less than 99962). Euler's totient φ(99962) = 49500 numbers up to 99962 share no factor with it.
- 4
The digits of 99962 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 99962 = 2 \times 151 \times 331 \]
99962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 151392 |
| Euler totient φ(n) | 49500 |
| Square | 9992401444 |
| Cube | 998860433145128 |
| Square root | 316.167677 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.9962 × |
99962 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand nine hundred and sixty-two |
| Binary (base 2) | 11000011001111010 |
| Octal (base 8) | 303172 |
| Hexadecimal (base 16) | 1867A |
| Base 3 | 12002010022 |
| As time | 99962 seconds = 27 h 46 min 2 s |
Is 99962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (99962 ÷ 2 = 49981) | 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 2) | 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 8) | 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 5) | 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 99962 a prime number?
No. 99962 = 2 × 151 × 331, so it is divisible by 2.
What are the factors of 99962?
1, 2, 151, 302, 331, 662, 49981, 99962.
What is 99962 in binary?
11000011001111010 (hexadecimal 1867A, octal 303172).
What is the square root of 99962?
About 316.1677.
Is 99962 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 99962?
It is a composite number with 8 divisors.