The number 91231
91231 is a composite number with 4 divisors. Its prime factorisation is 7 × 13033. Divisors (4): 1, 7, 13033, 91231.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91231: a semiprime: 7 × 13033, the product of two primes.
- 2
91231 is composite. Its prime factorisation is
- 3
The divisors add up to 104272; without 91231 itself that is 13041, so 91231 is deficient (13041 is less than 91231). Euler's totient φ(91231) = 78192 numbers up to 91231 share no factor with it.
- 4
The digits of 91231 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91231 = 7 \times 13033 \]
91231 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 104272 |
| Euler totient φ(n) | 78192 |
| Square | 8323095361 |
| Cube | 759324312879391 |
| Square root | 302.044699 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1231 × |
91231 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and thirty-one |
| Binary (base 2) | 10110010001011111 |
| Octal (base 8) | 262137 |
| Hexadecimal (base 16) | 1645F |
| Base 3 | 11122010221 |
| As time | 91231 seconds = 25 h 20 min 31 s |
Is 91231 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91231 ÷ 7 = 13033) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91231 a prime number?
No. 91231 = 7 × 13033, so it is divisible by 7.
What are the factors of 91231?
1, 7, 13033, 91231.
What is 91231 in binary?
10110010001011111 (hexadecimal 1645F, octal 262137).
What is the square root of 91231?
About 302.0447.
Is 91231 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 91231?
91231 is a semiprime: 7 × 13033, the product of two primes.