The number 52492
52492 is a composite number with 12 divisors. Its prime factorisation is × 11 × 1193. Divisors (12): 1, 2, 4, 11, 22, 44, 1193, 2386, 4772, 13123, 26246, 52492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52492: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 22.
- 2
52492 is composite. Its prime factorisation is
- 3
The divisors add up to 100296; without 52492 itself that is 47804, so 52492 is deficient (47804 is less than 52492). Euler's totient φ(52492) = 23840 numbers up to 52492 share no factor with it.
- 4
The digits of 52492 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52492 = 2^{2} \times 11 \times 1193 \]52492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 100296 |
| Euler totient φ(n) | 23840 |
| Square | 2755410064 |
| Cube | 144636985079488 |
| Square root | 229.111327 (= 2√13123) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.2492 × |
52492 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand four hundred and ninety-two |
| Binary (base 2) | 1100110100001100 |
| Octal (base 8) | 146414 |
| Hexadecimal (base 16) | CD0C |
| Base 3 | 2200000011 |
| As time | 52492 seconds = 14 h 34 min 52 s |
Is 52492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52492 ÷ 2 = 26246) | 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 | Yes (52492 ÷ 4 = 13123) | 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 4) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (52492 ÷ 11 = 4772) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52492 a prime number?
No. 52492 = × 11 × 1193, so it is divisible by 2.
What are the factors of 52492?
1, 2, 4, 11, 22, 44, 1193, 2386, 4772, 13123, 26246, 52492.
What is 52492 in binary?
1100110100001100 (hexadecimal CD0C, octal 146414).
What is the square root of 52492?
About 229.1113, exactly 2√13123.
Is 52492 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 52492?
52492 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 22.