The number 91238
91238 is a composite number with 20 divisors. Its prime factorisation is 2 × × 19. Divisors (20): 1, 2, 7, 14, 19, 38, 49, 98, 133, 266, 343, 686, 931, 1862, 2401, 4802 … 91238.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91238 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91238 is composite. Its prime factorisation is
- 3
The divisors add up to 168060; without 91238 itself that is 76822, so 91238 is deficient (76822 is less than 91238). Euler's totient φ(91238) = 37044 numbers up to 91238 share no factor with it.
- 4
The digits of 91238 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 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91238 = 2 \times 7^{4} \times 19 \]91238 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 168060 |
| Euler totient φ(n) | 37044 |
| Square | 8324372644 |
| Cube | 759499111293272 |
| Square root | 302.056286 (= 49√38) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.1238 × |
91238 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and thirty-eight |
| Binary (base 2) | 10110010001100110 |
| Octal (base 8) | 262146 |
| Hexadecimal (base 16) | 16466 |
| Base 3 | 11122011012 |
| As time | 91238 seconds = 25 h 20 min 38 s |
Is 91238 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91238 ÷ 2 = 45619) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91238 ÷ 7 = 13034) | 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 6) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91238 a prime number?
No. 91238 = 2 × × 19, so it is divisible by 2.
What are the factors of 91238?
1, 2, 7, 14, 19, 38, 49, 98, 133, 266, 343, 686, 931, 1862, 2401, 4802, 6517, 13034, 45619, 91238.
What is 91238 in binary?
10110010001100110 (hexadecimal 16466, octal 262146).
What is the square root of 91238?
About 302.0563, exactly 49√38.
Is 91238 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 91238?
It is a composite number with 20 divisors.