The number 99428
99428 is a composite number with 24 divisors. Its prime factorisation is × 7 × 53 × 67. Divisors (24): 1, 2, 4, 7, 14, 28, 53, 67, 106, 134, 212, 268, 371, 469, 742, 938 … 99428.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
99428 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
99428 is composite. Its prime factorisation is
- 3
The divisors add up to 205632; without 99428 itself that is 106204, so 99428 is abundant (106204 is more than 99428). Euler's totient φ(99428) = 41184 numbers up to 99428 share no factor with it.
- 4
The digits of 99428 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
\[ 99428 = 2^{2} \times 7 \times 53 \times 67 \]99428 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 205632 |
| Euler totient φ(n) | 41184 |
| Square | 9885927184 |
| Cube | 982937968050752 |
| Square root | 315.322058 (= 2√24857) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 66 |
| Scientific notation | 9.9428 × |
99428 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand four hundred and twenty-eight |
| Binary (base 2) | 11000010001100100 |
| Octal (base 8) | 302144 |
| Hexadecimal (base 16) | 18464 |
| Base 3 | 12001101112 |
| As time | 99428 seconds = 27 h 37 min 8 s |
Is 99428 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (99428 ÷ 2 = 49714) | 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 (99428 ÷ 4 = 24857) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 (99428 ÷ 7 = 14204) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 99428 a prime number?
No. 99428 = × 7 × 53 × 67, so it is divisible by 2.
What are the factors of 99428?
1, 2, 4, 7, 14, 28, 53, 67, 106, 134, 212, 268, 371, 469, 742, 938, 1484, 1876, 3551, 7102, 14204, 24857, 49714, 99428.
What is 99428 in binary?
11000010001100100 (hexadecimal 18464, octal 302144).
What is the square root of 99428?
About 315.3221, exactly 2√24857.
Is 99428 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 99428?
It is a composite number with 24 divisors.