The number 50481
50481 is a composite number with 12 divisors. Its prime factorisation is × 71 × 79. Divisors (12): 1, 3, 9, 71, 79, 213, 237, 639, 711, 5609, 16827, 50481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50481 is composite. Its prime factorisation is
- 3
The divisors add up to 74880; without 50481 itself that is 24399, so 50481 is deficient (24399 is less than 50481). Euler's totient φ(50481) = 32760 numbers up to 50481 share no factor with it.
- 4
The digits of 50481 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50481 = 3^{2} \times 71 \times 79 \]50481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 74880 |
| Euler totient φ(n) | 32760 |
| Square | 2548331361 |
| Cube | 128642315434641 |
| Square root | 224.679772 (= 3√5609) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0481 × |
50481 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and eighty-one |
| Binary (base 2) | 1100010100110001 |
| Octal (base 8) | 142461 |
| Hexadecimal (base 16) | C531 |
| Base 3 | 2120020200 |
| As time | 50481 seconds = 14 h 1 min 21 s |
Is 50481 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50481 ÷ 3 = 16827) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50481 ÷ 9 = 5609) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50481 a prime number?
No. 50481 = × 71 × 79, so it is divisible by 3.
What are the factors of 50481?
1, 3, 9, 71, 79, 213, 237, 639, 711, 5609, 16827, 50481.
What is 50481 in binary?
1100010100110001 (hexadecimal C531, octal 142461).
What is the square root of 50481?
About 224.6798, exactly 3√5609.
Is 50481 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50481?
It is a composite number with 12 divisors.