The number 50947
50947 is a composite number with 4 divisors. Its prime factorisation is 13 × 3919. Divisors (4): 1, 13, 3919, 50947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50947: a semiprime: 13 × 3919, the product of two primes.
- 2
50947 is composite. Its prime factorisation is
- 3
The divisors add up to 54880; without 50947 itself that is 3933, so 50947 is deficient (3933 is less than 50947). Euler's totient φ(50947) = 47016 numbers up to 50947 share no factor with it.
- 4
The digits of 50947 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
\[ 50947 = 13 \times 3919 \]
50947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54880 |
| Euler totient φ(n) | 47016 |
| Square | 2595596809 |
| Cube | 132237870628123 |
| Square root | 225.714421 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0947 × |
50947 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and forty-seven |
| Binary (base 2) | 1100011100000011 |
| Octal (base 8) | 143403 |
| Hexadecimal (base 16) | C703 |
| Base 3 | 2120212221 |
| As time | 50947 seconds = 14 h 9 min 7 s |
Is 50947 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50947 a prime number?
No. 50947 = 13 × 3919, so it is divisible by 13.
What are the factors of 50947?
1, 13, 3919, 50947.
What is 50947 in binary?
1100011100000011 (hexadecimal C703, octal 143403).
What is the square root of 50947?
About 225.7144.
Is 50947 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 50947?
50947 is a semiprime: 13 × 3919, the product of two primes.