The number 50482
50482 is a composite number with 8 divisors. Its prime factorisation is 2 × 43 × 587. Divisors (8): 1, 2, 43, 86, 587, 1174, 25241, 50482.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50482: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50482 is composite. Its prime factorisation is
- 3
The divisors add up to 77616; without 50482 itself that is 27134, so 50482 is deficient (27134 is less than 50482). Euler's totient φ(50482) = 24612 numbers up to 50482 share no factor with it.
- 4
The digits of 50482 add up to 19, 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
\[ 50482 = 2 \times 43 \times 587 \]
50482 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77616 |
| Euler totient φ(n) | 24612 |
| Square | 2548432324 |
| Cube | 128649960580168 |
| Square root | 224.681997 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0482 × |
50482 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and eighty-two |
| Binary (base 2) | 1100010100110010 |
| Octal (base 8) | 142462 |
| Hexadecimal (base 16) | C532 |
| Base 3 | 2120020201 |
| As time | 50482 seconds = 14 h 1 min 22 s |
Is 50482 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50482 ÷ 2 = 25241) | 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 | No (remainder 2) | 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 2) | 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 | No (remainder 2) | 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 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50482 a prime number?
No. 50482 = 2 × 43 × 587, so it is divisible by 2.
What are the factors of 50482?
1, 2, 43, 86, 587, 1174, 25241, 50482.
What is 50482 in binary?
1100010100110010 (hexadecimal C532, octal 142462).
What is the square root of 50482?
About 224.6820.
Is 50482 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50482?
50482 is a happy number: repeatedly adding the squares of its digits reaches 1.