The number 98051
98051 is a composite number with 4 divisors. Its prime factorisation is 71 × 1381. Divisors (4): 1, 71, 1381, 98051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 98051: a semiprime: 71 × 1381, the product of two primes.
- 2
98051 is composite. Its prime factorisation is
- 3
The divisors add up to 99504; without 98051 itself that is 1453, so 98051 is deficient (1453 is less than 98051). Euler's totient φ(98051) = 96600 numbers up to 98051 share no factor with it.
- 4
The digits of 98051 add up to 23, 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
\[ 98051 = 71 \times 1381 \]
98051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 99504 |
| Euler totient φ(n) | 96600 |
| Square | 9613998601 |
| Cube | 942662176826651 |
| Square root | 313.130963 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 159 |
| Scientific notation | 9.8051 × |
98051 in other forms
| Form | Value |
|---|---|
| In words | ninety-eight thousand and fifty-one |
| Binary (base 2) | 10111111100000011 |
| Octal (base 8) | 277403 |
| Hexadecimal (base 16) | 17F03 |
| Base 3 | 11222111112 |
| As time | 98051 seconds = 27 h 14 min 11 s |
Is 98051 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 2) | 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 3) | 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 8) | 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 98051 a prime number?
No. 98051 = 71 × 1381, so it is divisible by 71.
What are the factors of 98051?
1, 71, 1381, 98051.
What is 98051 in binary?
10111111100000011 (hexadecimal 17F03, octal 277403).
What is the square root of 98051?
About 313.1310.
Is 98051 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 98051?
98051 is a semiprime: 71 × 1381, the product of two primes.