The number 10131
10131 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 307. Divisors (8): 1, 3, 11, 33, 307, 921, 3377, 10131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10131 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10131 is composite. Its prime factorisation is
- 3
The divisors add up to 14784; without 10131 itself that is 4653, so 10131 is deficient (4653 is less than 10131). Euler's totient φ(10131) = 6120 numbers up to 10131 share no factor with it.
- 4
The digits of 10131 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10131 = 3 \times 11 \times 307 \]
10131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 14784 |
| Euler totient φ(n) | 6120 |
| Square | 102637161 |
| Cube | 1039817078091 |
| Square root | 100.652869 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 73 |
| Scientific notation | 1.0131 × |
10131 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and thirty-one |
| Binary (base 2) | 10011110010011 |
| Octal (base 8) | 23623 |
| Hexadecimal (base 16) | 2793 |
| Base 3 | 111220020 |
| As time | 10131 seconds = 2 h 48 min 51 s |
Is 10131 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 (10131 ÷ 3 = 3377) | 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 2) | 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 6) | 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 | Yes (10131 ÷ 11 = 921) | 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 10131 a prime number?
No. 10131 = 3 × 11 × 307, so it is divisible by 3.
What are the factors of 10131?
1, 3, 11, 33, 307, 921, 3377, 10131.
What is 10131 in binary?
10011110010011 (hexadecimal 2793, octal 23623).
What is the square root of 10131?
About 100.6529.
Is 10131 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 10131?
It is a composite number with 8 divisors.