The number 99950
99950 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1999. Divisors (12): 1, 2, 5, 10, 25, 50, 1999, 3998, 9995, 19990, 49975, 99950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
99950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
99950 is composite. Its prime factorisation is
- 3
The divisors add up to 186000; without 99950 itself that is 86050, so 99950 is deficient (86050 is less than 99950). Euler's totient φ(99950) = 39960 numbers up to 99950 share no factor with it.
- 4
The digits of 99950 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 99950 = 2 \times 5^{2} \times 1999 \]99950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 186000 |
| Euler totient φ(n) | 39960 |
| Square | 9990002500 |
| Cube | 998500749875000 |
| Square root | 316.148699 (= 5√3998) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.995 × |
99950 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand nine hundred and fifty |
| Binary (base 2) | 11000011001101110 |
| Octal (base 8) | 303156 |
| Hexadecimal (base 16) | 1866E |
| Base 3 | 12002002212 |
| As time | 99950 seconds = 27 h 45 min 50 s |
Is 99950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (99950 ÷ 2 = 49975) | 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 | Yes (99950 ÷ 5 = 19990) | 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 4) | 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 6) | 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 | Yes (99950 ÷ 10 = 9995) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 99950 a prime number?
No. 99950 = 2 × × 1999, so it is divisible by 2.
What are the factors of 99950?
1, 2, 5, 10, 25, 50, 1999, 3998, 9995, 19990, 49975, 99950.
What is 99950 in binary?
11000011001101110 (hexadecimal 1866E, octal 303156).
What is the square root of 99950?
About 316.1487, exactly 5√3998.
Is 99950 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 99950?
It is a composite number with 12 divisors.