The number 92141
92141 is a composite number with 4 divisors. Its prime factorisation is 7 × 13163. Divisors (4): 1, 7, 13163, 92141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 92141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 13163, the product of two primes.
- 2
92141 is composite. Its prime factorisation is
- 3
The divisors add up to 105312; without 92141 itself that is 13171, so 92141 is deficient (13171 is less than 92141). Euler's totient φ(92141) = 78972 numbers up to 92141 share no factor with it.
- 4
The digits of 92141 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92141 = 7 \times 13163 \]
92141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 105312 |
| Euler totient φ(n) | 78972 |
| Square | 8489963881 |
| Cube | 782273761959221 |
| Square root | 303.547360 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.2141 × |
92141 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand one hundred and forty-one |
| Binary (base 2) | 10110011111101101 |
| Octal (base 8) | 263755 |
| Hexadecimal (base 16) | 167ED |
| Base 3 | 11200101122 |
| As time | 92141 seconds = 25 h 35 min 41 s |
Is 92141 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 | Yes (92141 ÷ 7 = 13163) | 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 8) | 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 5) | 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 92141 a prime number?
No. 92141 = 7 × 13163, so it is divisible by 7.
What are the factors of 92141?
1, 7, 13163, 92141.
What is 92141 in binary?
10110011111101101 (hexadecimal 167ED, octal 263755).
What is the square root of 92141?
About 303.5474.
Is 92141 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 92141?
92141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 13163, the product of two primes.