The number 15131
15131 is the 1767th prime number. Its only divisors are 1 and 15131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15131: the 1767th prime number.
- 2
15131 is prime, so its only factors are 1 and 15131. It is the 1767th prime; the next prime is 15137 and the one before is 15121.
- 3
The divisors add up to 15132; without 15131 itself that is 1, so 15131 is deficient (1 is less than 15131). Euler's totient φ(15131) = 15130 numbers up to 15131 share no factor with it.
- 4
The digits of 15131 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 221 steps to reach 1.
15131 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 15132 |
| Euler totient φ(n) | 15130 |
| Square | 228947161 |
| Cube | 3464199493091 |
| Square root | 123.008130 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 221 |
| Scientific notation | 1.5131 × |
15131 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and thirty-one |
| Binary (base 2) | 11101100011011 |
| Octal (base 8) | 35433 |
| Hexadecimal (base 16) | 3B1B |
| Base 3 | 202202102 |
| As time | 15131 seconds = 4 h 12 min 11 s |
Is 15131 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 4) | 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 2) | 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 6) | 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 15131 a prime number?
Yes. 15131 is divisible only by 1 and itself.
What are the factors of 15131?
1, 15131.
What is 15131 in binary?
11101100011011 (hexadecimal 3B1B, octal 35433).
What is the square root of 15131?
About 123.0081.
Is 15131 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 15131?
15131 is the 1767th prime number.