The number 51460
51460 is a composite number with 24 divisors. Its prime factorisation is × 5 × 31 × 83. Divisors (24): 1, 2, 4, 5, 10, 20, 31, 62, 83, 124, 155, 166, 310, 332, 415, 620 … 51460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51460 is composite. Its prime factorisation is
- 3
The divisors add up to 112896; without 51460 itself that is 61436, so 51460 is abundant (61436 is more than 51460). Euler's totient φ(51460) = 19680 numbers up to 51460 share no factor with it.
- 4
The digits of 51460 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51460 = 2^{2} \times 5 \times 31 \times 83 \]51460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 112896 |
| Euler totient φ(n) | 19680 |
| Square | 2648131600 |
| Cube | 136272852136000 |
| Square root | 226.847967 (= 2√12865) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.146 × |
51460 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and sixty |
| Binary (base 2) | 1100100100000100 |
| Octal (base 8) | 144404 |
| Hexadecimal (base 16) | C904 |
| Base 3 | 2121120221 |
| As time | 51460 seconds = 14 h 17 min 40 s |
Is 51460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51460 ÷ 2 = 25730) | 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 (51460 ÷ 4 = 12865) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51460 ÷ 5 = 10292) | 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 3) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51460 ÷ 10 = 5146) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51460 a prime number?
No. 51460 = × 5 × 31 × 83, so it is divisible by 2.
What are the factors of 51460?
1, 2, 4, 5, 10, 20, 31, 62, 83, 124, 155, 166, 310, 332, 415, 620, 830, 1660, 2573, 5146, 10292, 12865, 25730, 51460.
What is 51460 in binary?
1100100100000100 (hexadecimal C904, octal 144404).
What is the square root of 51460?
About 226.8480, exactly 2√12865.
Is 51460 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51460?
It is a composite number with 24 divisors.