The number 91241
91241 is a composite number with 4 divisors. Its prime factorisation is 23 × 3967. Divisors (4): 1, 23, 3967, 91241.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91241: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 23 × 3967, the product of two primes.
- 2
91241 is composite. Its prime factorisation is
- 3
The divisors add up to 95232; without 91241 itself that is 3991, so 91241 is deficient (3991 is less than 91241). Euler's totient φ(91241) = 87252 numbers up to 91241 share no factor with it.
- 4
The digits of 91241 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 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91241 = 23 \times 3967 \]
91241 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 95232 |
| Euler totient φ(n) | 87252 |
| Square | 8324920081 |
| Cube | 759574033110521 |
| Square root | 302.061252 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 102 |
| Scientific notation | 9.1241 × |
91241 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and forty-one |
| Binary (base 2) | 10110010001101001 |
| Octal (base 8) | 262151 |
| Hexadecimal (base 16) | 16469 |
| Base 3 | 11122011022 |
| As time | 91241 seconds = 25 h 20 min 41 s |
Is 91241 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 1) | 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 7) | 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 91241 a prime number?
No. 91241 = 23 × 3967, so it is divisible by 23.
What are the factors of 91241?
1, 23, 3967, 91241.
What is 91241 in binary?
10110010001101001 (hexadecimal 16469, octal 262151).
What is the square root of 91241?
About 302.0613.
Is 91241 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 91241?
91241 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 23 × 3967, the product of two primes.