The number 61052
61052 is a composite number with 6 divisors. Its prime factorisation is × 15263. Divisors (6): 1, 2, 4, 15263, 30526, 61052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61052 is composite. Its prime factorisation is
- 3
The divisors add up to 106848; without 61052 itself that is 45796, so 61052 is deficient (45796 is less than 61052). Euler's totient φ(61052) = 30524 numbers up to 61052 share no factor with it.
- 4
The digits of 61052 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 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61052 = 2^{2} \times 15263 \]61052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 106848 |
| Euler totient φ(n) | 30524 |
| Square | 3727346704 |
| Cube | 227561970972608 |
| Square root | 247.087029 (= 2√15263) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.1052 × |
61052 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand and fifty-two |
| Binary (base 2) | 1110111001111100 |
| Octal (base 8) | 167174 |
| Hexadecimal (base 16) | EE7C |
| Base 3 | 10002202012 |
| As time | 61052 seconds = 16 h 57 min 32 s |
Is 61052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61052 ÷ 2 = 30526) | 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 | Yes (61052 ÷ 4 = 15263) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | 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 2) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61052 a prime number?
No. 61052 = × 15263, so it is divisible by 2.
What are the factors of 61052?
1, 2, 4, 15263, 30526, 61052.
What is 61052 in binary?
1110111001111100 (hexadecimal EE7C, octal 167174).
What is the square root of 61052?
About 247.0870, exactly 2√15263.
Is 61052 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 61052?
It is a composite number with 6 divisors.