The number 99932
99932 is a composite number with 24 divisors. Its prime factorisation is × 7 × 43 × 83. Divisors (24): 1, 2, 4, 7, 14, 28, 43, 83, 86, 166, 172, 301, 332, 581, 602, 1162 … 99932.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
99932 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
99932 is composite. Its prime factorisation is
- 3
The divisors add up to 206976; without 99932 itself that is 107044, so 99932 is abundant (107044 is more than 99932). Euler's totient φ(99932) = 41328 numbers up to 99932 share no factor with it.
- 4
The digits of 99932 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 99932 = 2^{2} \times 7 \times 43 \times 83 \]99932 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 206976 |
| Euler totient φ(n) | 41328 |
| Square | 9986404624 |
| Cube | 997961386885568 |
| Square root | 316.120230 (= 2√24983) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 66 |
| Scientific notation | 9.9932 × |
99932 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand nine hundred and thirty-two |
| Binary (base 2) | 11000011001011100 |
| Octal (base 8) | 303134 |
| Hexadecimal (base 16) | 1865C |
| Base 3 | 12002002012 |
| As time | 99932 seconds = 27 h 45 min 32 s |
Is 99932 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (99932 ÷ 2 = 49966) | 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 | Yes (99932 ÷ 4 = 24983) | 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 | Yes (99932 ÷ 7 = 14276) | 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 4) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 99932 a prime number?
No. 99932 = × 7 × 43 × 83, so it is divisible by 2.
What are the factors of 99932?
1, 2, 4, 7, 14, 28, 43, 83, 86, 166, 172, 301, 332, 581, 602, 1162, 1204, 2324, 3569, 7138, 14276, 24983, 49966, 99932.
What is 99932 in binary?
11000011001011100 (hexadecimal 1865C, octal 303134).
What is the square root of 99932?
About 316.1202, exactly 2√24983.
Is 99932 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 99932?
It is a composite number with 24 divisors.