The number 50430
50430 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × 5 × . Divisors (24): 1, 2, 3, 5, 6, 10, 15, 30, 41, 82, 123, 205, 246, 410, 615, 1230 … 50430.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50430 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50430 is composite. Its prime factorisation is
- 3
The divisors add up to 124056; without 50430 itself that is 73626, so 50430 is abundant (73626 is more than 50430). Euler's totient φ(50430) = 13120 numbers up to 50430 share no factor with it.
- 4
The digits of 50430 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50430 = 2 \times 3 \times 5 \times 41^{2} \]50430 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 124056 |
| Euler totient φ(n) | 13120 |
| Square | 2543184900 |
| Cube | 128252814507000 |
| Square root | 224.566249 (= 41√30) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 189 |
| Scientific notation | 5.043 × |
50430 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and thirty |
| Binary (base 2) | 1100010011111110 |
| Octal (base 8) | 142376 |
| Hexadecimal (base 16) | C4FE |
| Base 3 | 2120011210 |
| As time | 50430 seconds = 14 h 0 min 30 s |
Is 50430 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50430 ÷ 2 = 25215) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50430 ÷ 3 = 16810) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50430 ÷ 5 = 10086) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50430 ÷ 6 = 8405) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50430 ÷ 10 = 5043) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50430 a prime number?
No. 50430 = 2 × 3 × 5 × , so it is divisible by 2.
What are the factors of 50430?
1, 2, 3, 5, 6, 10, 15, 30, 41, 82, 123, 205, 246, 410, 615, 1230, 1681, 3362, 5043, 8405, 10086, 16810, 25215, 50430.
What is 50430 in binary?
1100010011111110 (hexadecimal C4FE, octal 142376).
What is the square root of 50430?
About 224.5662, exactly 41√30.
Is 50430 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50430?
It is a composite number with 24 divisors.