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