The number 98141
98141 is a composite number with 8 divisors. Its prime factorisation is 17 × 23 × 251. Divisors (8): 1, 17, 23, 251, 391, 4267, 5773, 98141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 98141: a Harshad number: divisible by its digit sum 23.
- 2
98141 is composite. Its prime factorisation is
- 3
The divisors add up to 108864; without 98141 itself that is 10723, so 98141 is deficient (10723 is less than 98141). Euler's totient φ(98141) = 88000 numbers up to 98141 share no factor with it.
- 4
The digits of 98141 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 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 98141 = 17 \times 23 \times 251 \]
98141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 108864 |
| Euler totient φ(n) | 88000 |
| Square | 9631655881 |
| Cube | 945260339817221 |
| Square root | 313.274640 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 128 |
| Scientific notation | 9.8141 × |
98141 in other forms
| Form | Value |
|---|---|
| In words | ninety-eight thousand one hundred and forty-one |
| Binary (base 2) | 10111111101011101 |
| Octal (base 8) | 277535 |
| Hexadecimal (base 16) | 17F5D |
| Base 3 | 11222121212 |
| As time | 98141 seconds = 27 h 15 min 41 s |
Is 98141 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 1) | 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 1) | 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 5) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 98141 a prime number?
No. 98141 = 17 × 23 × 251, so it is divisible by 17.
What are the factors of 98141?
1, 17, 23, 251, 391, 4267, 5773, 98141.
What is 98141 in binary?
10111111101011101 (hexadecimal 17F5D, octal 277535).
What is the square root of 98141?
About 313.2746.
Is 98141 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 98141?
98141 is a Harshad number: divisible by its digit sum 23.