The number 50946
50946 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 7 × 1213. Divisors (16): 1, 2, 3, 6, 7, 14, 21, 42, 1213, 2426, 3639, 7278, 8491, 16982, 25473, 50946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50946 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50946 is composite. Its prime factorisation is
- 3
The divisors add up to 116544; without 50946 itself that is 65598, so 50946 is abundant (65598 is more than 50946). Euler's totient φ(50946) = 14544 numbers up to 50946 share no factor with it.
- 4
The digits of 50946 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50946 = 2 \times 3 \times 7 \times 1213 \]
50946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 116544 |
| Euler totient φ(n) | 14544 |
| Square | 2595494916 |
| Cube | 132230083990536 |
| Square root | 225.712206 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0946 × |
50946 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and forty-six |
| Binary (base 2) | 1100011100000010 |
| Octal (base 8) | 143402 |
| Hexadecimal (base 16) | C702 |
| Base 3 | 2120212220 |
| As time | 50946 seconds = 14 h 9 min 6 s |
Is 50946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50946 ÷ 2 = 25473) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50946 ÷ 3 = 16982) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50946 ÷ 6 = 8491) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50946 ÷ 7 = 7278) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50946 a prime number?
No. 50946 = 2 × 3 × 7 × 1213, so it is divisible by 2.
What are the factors of 50946?
1, 2, 3, 6, 7, 14, 21, 42, 1213, 2426, 3639, 7278, 8491, 16982, 25473, 50946.
What is 50946 in binary?
1100011100000010 (hexadecimal C702, octal 143402).
What is the square root of 50946?
About 225.7122.
Is 50946 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 50946?
It is a composite number with 16 divisors.