The number 15161
15161 is the 1771st prime number. Its only divisors are 1 and 15161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15161: the 1771st prime number.
- 2
15161 is prime, so its only factors are 1 and 15161. It is the 1771st prime; the next prime is 15173 and the one before is 15149.
- 3
The divisors add up to 15162; without 15161 itself that is 1, so 15161 is deficient (1 is less than 15161). Euler's totient φ(15161) = 15160 numbers up to 15161 share no factor with it.
- 4
The digits of 15161 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
15161 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 15162 |
| Euler totient φ(n) | 15160 |
| Square | 229855921 |
| Cube | 3484845618281 |
| Square root | 123.130013 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5161 × |
15161 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and sixty-one |
| Binary (base 2) | 11101100111001 |
| Octal (base 8) | 35471 |
| Hexadecimal (base 16) | 3B39 |
| Base 3 | 202210112 |
| As time | 15161 seconds = 4 h 12 min 41 s |
Is 15161 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 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 6) | 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 5) | 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 3) | 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 15161 a prime number?
Yes. 15161 is divisible only by 1 and itself.
What are the factors of 15161?
1, 15161.
What is 15161 in binary?
11101100111001 (hexadecimal 3B39, octal 35471).
What is the square root of 15161?
About 123.1300.
Is 15161 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 15161?
15161 is the 1771st prime number.