The number 9131
9131 is a composite number with 4 divisors. Its prime factorisation is 23 × 397. Divisors (4): 1, 23, 397, 9131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9131: a semiprime: 23 × 397, the product of two primes.
- 2
9131 is composite. Its prime factorisation is
- 3
The divisors add up to 9552; without 9131 itself that is 421, so 9131 is deficient (421 is less than 9131). Euler's totient φ(9131) = 8712 numbers up to 9131 share no factor with it.
- 4
The digits of 9131 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9131 = 23 \times 397 \]
9131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9552 |
| Euler totient φ(n) | 8712 |
| Square | 83375161 |
| Cube | 761298595091 |
| Square root | 95.556266 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 153 |
| Scientific notation | 9.131 × |
9131 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and thirty-one |
| Binary (base 2) | 10001110101011 |
| Octal (base 8) | 21653 |
| Hexadecimal (base 16) | 23AB |
| Base 3 | 110112012 |
| As time | 9131 seconds = 2 h 32 min 11 s |
Is 9131 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 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 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 3) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9131 a prime number?
No. 9131 = 23 × 397, so it is divisible by 23.
What are the factors of 9131?
1, 23, 397, 9131.
What is 9131 in binary?
10001110101011 (hexadecimal 23AB, octal 21653).
What is the square root of 9131?
About 95.5563.
Is 9131 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 9131?
9131 is a semiprime: 23 × 397, the product of two primes.