The number 50460
50460 is a composite number with 36 divisors. Its prime factorisation is × 3 × 5 × . Divisors (36): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 29, 30, 58, 60, 87, 116 … 50460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50460: a Harshad number: divisible by its digit sum 15.
- 2
50460 is composite. Its prime factorisation is
- 3
The divisors add up to 146328; without 50460 itself that is 95868, so 50460 is abundant (95868 is more than 50460). Euler's totient φ(50460) = 12992 numbers up to 50460 share no factor with it.
- 4
The digits of 50460 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50460 = 2^{2} \times 3 \times 5 \times 29^{2} \]50460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 146328 |
| Euler totient φ(n) | 12992 |
| Square | 2546211600 |
| Cube | 128481837336000 |
| Square root | 224.633034 (= 58√15) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.046 × |
50460 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and sixty |
| Binary (base 2) | 1100010100011100 |
| Octal (base 8) | 142434 |
| Hexadecimal (base 16) | C51C |
| Base 3 | 2120012220 |
| As time | 50460 seconds = 14 h 1 min 0 s |
Is 50460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50460 ÷ 2 = 25230) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50460 ÷ 3 = 16820) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50460 ÷ 4 = 12615) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50460 ÷ 5 = 10092) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50460 ÷ 6 = 8410) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50460 ÷ 10 = 5046) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50460 ÷ 12 = 4205) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50460 a prime number?
No. 50460 = × 3 × 5 × , so it is divisible by 2.
What are the factors of 50460?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 29, 30, 58, 60, 87, 116, 145, 174, 290, 348, 435, 580, 841, 870, 1682, 1740, 2523, 3364, 4205, 5046, 8410, 10092, 12615, 16820, 25230, 50460.
What is 50460 in binary?
1100010100011100 (hexadecimal C51C, octal 142434).
What is the square root of 50460?
About 224.6330, exactly 58√15.
Is 50460 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50460?
50460 is a Harshad number: divisible by its digit sum 15.