The number 15361
15361 is a twin prime (15359 and 15361 are both prime) and the 1795th prime number. Its only divisors are 1 and 15361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15361: a twin prime (15359 and 15361 are both prime); the 1795th prime number.
- 2
15361 is prime, so its only factors are 1 and 15361. It is the 1795th prime; the next prime is 15373 and the one before is 15359.
- 3
The divisors add up to 15362; without 15361 itself that is 1, so 15361 is deficient (1 is less than 15361). Euler's totient φ(15361) = 15360 numbers up to 15361 share no factor with it.
- 4
The digits of 15361 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
15361 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 15362 |
| Euler totient φ(n) | 15360 |
| Square | 235960321 |
| Cube | 3624586490881 |
| Square root | 123.939501 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 177 |
| Scientific notation | 1.5361 × |
15361 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and sixty-one |
| Binary (base 2) | 11110000000001 |
| Octal (base 8) | 36001 |
| Hexadecimal (base 16) | 3C01 |
| Base 3 | 210001221 |
| As time | 15361 seconds = 4 h 16 min 1 s |
Is 15361 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 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 7) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15361 a prime number?
Yes. 15361 is divisible only by 1 and itself.
What are the factors of 15361?
1, 15361.
What is 15361 in binary?
11110000000001 (hexadecimal 3C01, octal 36001).
What is the square root of 15361?
About 123.9395.
Is 15361 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 15361?
15361 is a twin prime (15359 and 15361 are both prime); the 1795th prime number.