The number 7131
7131 is a composite number with 4 divisors. Its prime factorisation is 3 × 2377. Divisors (4): 1, 3, 2377, 7131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 7131: a semiprime: 3 × 2377, the product of two primes.
- 2
7131 is composite. Its prime factorisation is
- 3
The divisors add up to 9512; without 7131 itself that is 2381, so 7131 is deficient (2381 is less than 7131). Euler's totient φ(7131) = 4752 numbers up to 7131 share no factor with it.
- 4
The digits of 7131 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 194 steps to reach 1.
LaTeX source of the formulas on this page
\[ 7131 = 3 \times 2377 \]
7131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9512 |
| Euler totient φ(n) | 4752 |
| Square | 50851161 |
| Cube | 362619629091 |
| Square root | 84.445249 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 194 |
| Scientific notation | 7.131 × |
7131 in other forms
| Form | Value |
|---|---|
| In words | seven thousand one hundred and thirty-one |
| Binary (base 2) | 1101111011011 |
| Octal (base 8) | 15733 |
| Hexadecimal (base 16) | 1BDB |
| Base 3 | 100210010 |
| As time | 7131 seconds = 1 h 58 min 51 s |
Is 7131 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 | Yes (7131 ÷ 3 = 2377) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 7131 a prime number?
No. 7131 = 3 × 2377, so it is divisible by 3.
What are the factors of 7131?
1, 3, 2377, 7131.
What is 7131 in binary?
1101111011011 (hexadecimal 1BDB, octal 15733).
What is the square root of 7131?
About 84.4452.
Is 7131 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 7131?
7131 is a semiprime: 3 × 2377, the product of two primes.