The number 52460
52460 is a composite number with 24 divisors. Its prime factorisation is × 5 × 43 × 61. Divisors (24): 1, 2, 4, 5, 10, 20, 43, 61, 86, 122, 172, 215, 244, 305, 430, 610 … 52460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52460 is composite. Its prime factorisation is
- 3
The divisors add up to 114576; without 52460 itself that is 62116, so 52460 is abundant (62116 is more than 52460). Euler's totient φ(52460) = 20160 numbers up to 52460 share no factor with it.
- 4
The digits of 52460 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52460 = 2^{2} \times 5 \times 43 \times 61 \]52460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 114576 |
| Euler totient φ(n) | 20160 |
| Square | 2752051600 |
| Cube | 144372626936000 |
| Square root | 229.041481 (= 2√13115) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.246 × |
52460 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand four hundred and sixty |
| Binary (base 2) | 1100110011101100 |
| Octal (base 8) | 146354 |
| Hexadecimal (base 16) | CCEC |
| Base 3 | 2122221222 |
| As time | 52460 seconds = 14 h 34 min 20 s |
Is 52460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52460 ÷ 2 = 26230) | 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 (52460 ÷ 4 = 13115) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (52460 ÷ 5 = 10492) | 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 2) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (52460 ÷ 10 = 5246) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 52460 a prime number?
No. 52460 = × 5 × 43 × 61, so it is divisible by 2.
What are the factors of 52460?
1, 2, 4, 5, 10, 20, 43, 61, 86, 122, 172, 215, 244, 305, 430, 610, 860, 1220, 2623, 5246, 10492, 13115, 26230, 52460.
What is 52460 in binary?
1100110011101100 (hexadecimal CCEC, octal 146354).
What is the square root of 52460?
About 229.0415, exactly 2√13115.
Is 52460 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 52460?
It is a composite number with 24 divisors.