The number 50230
50230 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5023. Divisors (8): 1, 2, 5, 10, 5023, 10046, 25115, 50230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50230: a Harshad number: divisible by its digit sum 10.
- 2
50230 is composite. Its prime factorisation is
- 3
The divisors add up to 90432; without 50230 itself that is 40202, so 50230 is deficient (40202 is less than 50230). Euler's totient φ(50230) = 20088 numbers up to 50230 share no factor with it.
- 4
The digits of 50230 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50230 = 2 \times 5 \times 5023 \]
50230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90432 |
| Euler totient φ(n) | 20088 |
| Square | 2523052900 |
| Cube | 126732947167000 |
| Square root | 224.120503 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.023 × |
50230 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and thirty |
| Binary (base 2) | 1100010000110110 |
| Octal (base 8) | 142066 |
| Hexadecimal (base 16) | C436 |
| Base 3 | 2112220101 |
| As time | 50230 seconds = 13 h 57 min 10 s |
Is 50230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50230 ÷ 2 = 25115) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50230 ÷ 5 = 10046) | 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 5) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50230 ÷ 10 = 5023) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50230 a prime number?
No. 50230 = 2 × 5 × 5023, so it is divisible by 2.
What are the factors of 50230?
1, 2, 5, 10, 5023, 10046, 25115, 50230.
What is 50230 in binary?
1100010000110110 (hexadecimal C436, octal 142066).
What is the square root of 50230?
About 224.1205.
Is 50230 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 50230?
50230 is a Harshad number: divisible by its digit sum 10.