The number 50948
50948 is a composite number with 12 divisors. Its prime factorisation is × 47 × 271. Divisors (12): 1, 2, 4, 47, 94, 188, 271, 542, 1084, 12737, 25474, 50948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50948 is composite. Its prime factorisation is
- 3
The divisors add up to 91392; without 50948 itself that is 40444, so 50948 is deficient (40444 is less than 50948). Euler's totient φ(50948) = 24840 numbers up to 50948 share no factor with it.
- 4
The digits of 50948 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50948 = 2^{2} \times 47 \times 271 \]50948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91392 |
| Euler totient φ(n) | 24840 |
| Square | 2595698704 |
| Cube | 132245657571392 |
| Square root | 225.716637 (= 2√12737) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0948 × |
50948 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and forty-eight |
| Binary (base 2) | 1100011100000100 |
| Octal (base 8) | 143404 |
| Hexadecimal (base 16) | C704 |
| Base 3 | 2120212222 |
| As time | 50948 seconds = 14 h 9 min 8 s |
Is 50948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50948 ÷ 2 = 25474) | 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 (50948 ÷ 4 = 12737) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 50948 a prime number?
No. 50948 = × 47 × 271, so it is divisible by 2.
What are the factors of 50948?
1, 2, 4, 47, 94, 188, 271, 542, 1084, 12737, 25474, 50948.
What is 50948 in binary?
1100011100000100 (hexadecimal C704, octal 143404).
What is the square root of 50948?
About 225.7166, exactly 2√12737.
Is 50948 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 50948?
It is a composite number with 12 divisors.