The number 98951
98951 is a composite number with 4 divisors. Its prime factorisation is 53 × 1867. Divisors (4): 1, 53, 1867, 98951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 98951: a semiprime: 53 × 1867, the product of two primes.
- 2
98951 is composite. Its prime factorisation is
- 3
The divisors add up to 100872; without 98951 itself that is 1921, so 98951 is deficient (1921 is less than 98951). Euler's totient φ(98951) = 97032 numbers up to 98951 share no factor with it.
- 4
The digits of 98951 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 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 98951 = 53 \times 1867 \]
98951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 100872 |
| Euler totient φ(n) | 97032 |
| Square | 9791300401 |
| Cube | 968858965979351 |
| Square root | 314.564779 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 159 |
| Scientific notation | 9.8951 × |
98951 in other forms
| Form | Value |
|---|---|
| In words | ninety-eight thousand nine hundred and fifty-one |
| Binary (base 2) | 11000001010000111 |
| Octal (base 8) | 301207 |
| Hexadecimal (base 16) | 18287 |
| Base 3 | 12000201212 |
| As time | 98951 seconds = 27 h 29 min 11 s |
Is 98951 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 98951 a prime number?
No. 98951 = 53 × 1867, so it is divisible by 53.
What are the factors of 98951?
1, 53, 1867, 98951.
What is 98951 in binary?
11000001010000111 (hexadecimal 18287, octal 301207).
What is the square root of 98951?
About 314.5648.
Is 98951 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 98951?
98951 is a semiprime: 53 × 1867, the product of two primes.