The number 15261
15261 is a composite number with 4 divisors. Its prime factorisation is 3 × 5087. Divisors (4): 1, 3, 5087, 15261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15261: a semiprime: 3 × 5087, the product of two primes.
- 2
15261 is composite. Its prime factorisation is
- 3
The divisors add up to 20352; without 15261 itself that is 5091, so 15261 is deficient (5091 is less than 15261). Euler's totient φ(15261) = 10172 numbers up to 15261 share no factor with it.
- 4
The digits of 15261 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15261 = 3 \times 5087 \]
15261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20352 |
| Euler totient φ(n) | 10172 |
| Square | 232898121 |
| Cube | 3554258224581 |
| Square root | 123.535420 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 177 |
| Scientific notation | 1.5261 × |
15261 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and sixty-one |
| Binary (base 2) | 11101110011101 |
| Octal (base 8) | 35635 |
| Hexadecimal (base 16) | 3B9D |
| Base 3 | 202221020 |
| As time | 15261 seconds = 4 h 14 min 21 s |
Is 15261 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 | Yes (15261 ÷ 3 = 5087) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15261 a prime number?
No. 15261 = 3 × 5087, so it is divisible by 3.
What are the factors of 15261?
1, 3, 5087, 15261.
What is 15261 in binary?
11101110011101 (hexadecimal 3B9D, octal 35635).
What is the square root of 15261?
About 123.5354.
Is 15261 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15261?
15261 is a semiprime: 3 × 5087, the product of two primes.