The number 15137
15137 is a twin prime (15137 and 15139 are both prime) and the 1768th prime number. Its only divisors are 1 and 15137.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15137: a twin prime (15137 and 15139 are both prime); the 1768th prime number.
- 2
15137 is prime, so its only factors are 1 and 15137. It is the 1768th prime; the next prime is 15139 and the one before is 15131.
- 3
The divisors add up to 15138; without 15137 itself that is 1, so 15137 is deficient (1 is less than 15137). Euler's totient φ(15137) = 15136 numbers up to 15137 share no factor with it.
- 4
The digits of 15137 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
15137 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 15138 |
| Euler totient φ(n) | 15136 |
| Square | 229128769 |
| Cube | 3468322176353 |
| Square root | 123.032516 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.5137 × |
15137 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and thirty-seven |
| Binary (base 2) | 11101100100001 |
| Octal (base 8) | 35441 |
| Hexadecimal (base 16) | 3B21 |
| Base 3 | 202202122 |
| As time | 15137 seconds = 4 h 12 min 17 s |
Is 15137 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15137 a prime number?
Yes. 15137 is divisible only by 1 and itself.
What are the factors of 15137?
1, 15137.
What is 15137 in binary?
11101100100001 (hexadecimal 3B21, octal 35441).
What is the square root of 15137?
About 123.0325.
Is 15137 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15137?
15137 is a twin prime (15137 and 15139 are both prime); the 1768th prime number.