The number 99364
99364 is a composite number with 6 divisors. Its prime factorisation is × 24841. Divisors (6): 1, 2, 4, 24841, 49682, 99364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
99364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
99364 is composite. Its prime factorisation is
- 3
The divisors add up to 173894; without 99364 itself that is 74530, so 99364 is deficient (74530 is less than 99364). Euler's totient φ(99364) = 49680 numbers up to 99364 share no factor with it.
- 4
The digits of 99364 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 99364 = 2^{2} \times 24841 \]99364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 173894 |
| Euler totient φ(n) | 49680 |
| Square | 9873204496 |
| Cube | 981041091540544 |
| Square root | 315.220558 (= 2√24841) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.9364 × |
99364 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand three hundred and sixty-four |
| Binary (base 2) | 11000010000100100 |
| Octal (base 8) | 302044 |
| Hexadecimal (base 16) | 18424 |
| Base 3 | 12001022011 |
| As time | 99364 seconds = 27 h 36 min 4 s |
Is 99364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (99364 ÷ 2 = 49682) | 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 | Yes (99364 ÷ 4 = 24841) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 4) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 99364 a prime number?
No. 99364 = × 24841, so it is divisible by 2.
What are the factors of 99364?
1, 2, 4, 24841, 49682, 99364.
What is 99364 in binary?
11000010000100100 (hexadecimal 18424, octal 302044).
What is the square root of 99364?
About 315.2206, exactly 2√24841.
Is 99364 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 99364?
It is a composite number with 6 divisors.