The number 16131
16131 is a composite number with 8 divisors. Its prime factorisation is 3 × 19 × 283. Divisors (8): 1, 3, 19, 57, 283, 849, 5377, 16131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16131 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16131 is composite. Its prime factorisation is
- 3
The divisors add up to 22720; without 16131 itself that is 6589, so 16131 is deficient (6589 is less than 16131). Euler's totient φ(16131) = 10152 numbers up to 16131 share no factor with it.
- 4
The digits of 16131 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16131 = 3 \times 19 \times 283 \]
16131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22720 |
| Euler totient φ(n) | 10152 |
| Square | 260209161 |
| Cube | 4197433976091 |
| Square root | 127.007874 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.6131 × |
16131 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and thirty-one |
| Binary (base 2) | 11111100000011 |
| Octal (base 8) | 37403 |
| Hexadecimal (base 16) | 3F03 |
| Base 3 | 211010110 |
| As time | 16131 seconds = 4 h 28 min 51 s |
Is 16131 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 (16131 ÷ 3 = 5377) | 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 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 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 5) | 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 16131 a prime number?
No. 16131 = 3 × 19 × 283, so it is divisible by 3.
What are the factors of 16131?
1, 3, 19, 57, 283, 849, 5377, 16131.
What is 16131 in binary?
11111100000011 (hexadecimal 3F03, octal 37403).
What is the square root of 16131?
About 127.0079.
Is 16131 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 16131?
It is a composite number with 8 divisors.