The number 52261
52261 is a composite number with 4 divisors. Its prime factorisation is 11 × 4751. Divisors (4): 1, 11, 4751, 52261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52261: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 4751, the product of two primes.
- 2
52261 is composite. Its prime factorisation is
- 3
The divisors add up to 57024; without 52261 itself that is 4763, so 52261 is deficient (4763 is less than 52261). Euler's totient φ(52261) = 47500 numbers up to 52261 share no factor with it.
- 4
The digits of 52261 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52261 = 11 \times 4751 \]
52261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57024 |
| Euler totient φ(n) | 47500 |
| Square | 2731212121 |
| Cube | 142735876655581 |
| Square root | 228.606649 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.2261 × |
52261 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand two hundred and sixty-one |
| Binary (base 2) | 1100110000100101 |
| Octal (base 8) | 146045 |
| Hexadecimal (base 16) | CC25 |
| Base 3 | 2122200121 |
| As time | 52261 seconds = 14 h 31 min 1 s |
Is 52261 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 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 5) | 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 | Yes (52261 ÷ 11 = 4751) | 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 52261 a prime number?
No. 52261 = 11 × 4751, so it is divisible by 11.
What are the factors of 52261?
1, 11, 4751, 52261.
What is 52261 in binary?
1100110000100101 (hexadecimal CC25, octal 146045).
What is the square root of 52261?
About 228.6066.
Is 52261 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 52261?
52261 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 4751, the product of two primes.