The number 89141
89141 is a composite number with 4 divisors. Its prime factorisation is 13 × 6857. Divisors (4): 1, 13, 6857, 89141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89141: a semiprime: 13 × 6857, the product of two primes.
- 2
89141 is composite. Its prime factorisation is
- 3
The divisors add up to 96012; without 89141 itself that is 6871, so 89141 is deficient (6871 is less than 89141). Euler's totient φ(89141) = 82272 numbers up to 89141 share no factor with it.
- 4
The digits of 89141 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89141 = 13 \times 6857 \]
89141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96012 |
| Euler totient φ(n) | 82272 |
| Square | 7946117881 |
| Cube | 708324894030221 |
| Square root | 298.564901 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 71 |
| Scientific notation | 8.9141 × |
89141 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand one hundred and forty-one |
| Binary (base 2) | 10101110000110101 |
| Octal (base 8) | 256065 |
| Hexadecimal (base 16) | 15C35 |
| Base 3 | 11112021112 |
| As time | 89141 seconds = 24 h 45 min 41 s |
Is 89141 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 3) | 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 8) | 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 89141 a prime number?
No. 89141 = 13 × 6857, so it is divisible by 13.
What are the factors of 89141?
1, 13, 6857, 89141.
What is 89141 in binary?
10101110000110101 (hexadecimal 15C35, octal 256065).
What is the square root of 89141?
About 298.5649.
Is 89141 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 89141?
89141 is a semiprime: 13 × 6857, the product of two primes.