The number 15061
15061 is the 1759th prime number. Its only divisors are 1 and 15061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15061: the 1759th prime number.
- 2
15061 is prime, so its only factors are 1 and 15061. It is the 1759th prime; the next prime is 15073 and the one before is 15053.
- 3
The divisors add up to 15062; without 15061 itself that is 1, so 15061 is deficient (1 is less than 15061). Euler's totient φ(15061) = 15060 numbers up to 15061 share no factor with it.
- 4
The digits of 15061 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
15061 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 15062 |
| Euler totient φ(n) | 15060 |
| Square | 226833721 |
| Cube | 3416342671981 |
| Square root | 122.723266 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5061 × |
15061 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and sixty-one |
| Binary (base 2) | 11101011010101 |
| Octal (base 8) | 35325 |
| Hexadecimal (base 16) | 3AD5 |
| Base 3 | 202122211 |
| As time | 15061 seconds = 4 h 11 min 1 s |
Is 15061 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 2) | 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 15061 a prime number?
Yes. 15061 is divisible only by 1 and itself.
What are the factors of 15061?
1, 15061.
What is 15061 in binary?
11101011010101 (hexadecimal 3AD5, octal 35325).
What is the square root of 15061?
About 122.7233.
Is 15061 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15061?
15061 is the 1759th prime number.