The number 50984
50984 is a composite number with 8 divisors. Its prime factorisation is × 6373. Divisors (8): 1, 2, 4, 8, 6373, 12746, 25492, 50984.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50984 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50984 is composite. Its prime factorisation is
- 3
The divisors add up to 95610; without 50984 itself that is 44626, so 50984 is deficient (44626 is less than 50984). Euler's totient φ(50984) = 25488 numbers up to 50984 share no factor with it.
- 4
The digits of 50984 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50984 = 2^{3} \times 6373 \]50984 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 95610 |
| Euler totient φ(n) | 25488 |
| Square | 2599368256 |
| Cube | 132526191163904 |
| Square root | 225.796368 (= 2√12746) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0984 × |
50984 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and eighty-four |
| Binary (base 2) | 1100011100101000 |
| Octal (base 8) | 143450 |
| Hexadecimal (base 16) | C728 |
| Base 3 | 2120221022 |
| As time | 50984 seconds = 14 h 9 min 44 s |
Is 50984 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50984 ÷ 2 = 25492) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50984 ÷ 4 = 12746) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | Yes (50984 ÷ 8 = 6373) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50984 a prime number?
No. 50984 = × 6373, so it is divisible by 2.
What are the factors of 50984?
1, 2, 4, 8, 6373, 12746, 25492, 50984.
What is 50984 in binary?
1100011100101000 (hexadecimal C728, octal 143450).
What is the square root of 50984?
About 225.7964, exactly 2√12746.
Is 50984 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 50984?
It is a composite number with 8 divisors.