The number 50643
50643 is a composite number with 12 divisors. Its prime factorisation is × 17 × 331. Divisors (12): 1, 3, 9, 17, 51, 153, 331, 993, 2979, 5627, 16881, 50643.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50643: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50643 is composite. Its prime factorisation is
- 3
The divisors add up to 77688; without 50643 itself that is 27045, so 50643 is deficient (27045 is less than 50643). Euler's totient φ(50643) = 31680 numbers up to 50643 share no factor with it.
- 4
The digits of 50643 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50643 = 3^{2} \times 17 \times 331 \]50643 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 77688 |
| Euler totient φ(n) | 31680 |
| Square | 2564713449 |
| Cube | 129884783197707 |
| Square root | 225.039996 (= 3√5627) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0643 × |
50643 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and forty-three |
| Binary (base 2) | 1100010111010011 |
| Octal (base 8) | 142723 |
| Hexadecimal (base 16) | C5D3 |
| Base 3 | 2120110200 |
| As time | 50643 seconds = 14 h 4 min 3 s |
Is 50643 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 | Yes (50643 ÷ 3 = 16881) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (50643 ÷ 9 = 5627) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50643 a prime number?
No. 50643 = × 17 × 331, so it is divisible by 3.
What are the factors of 50643?
1, 3, 9, 17, 51, 153, 331, 993, 2979, 5627, 16881, 50643.
What is 50643 in binary?
1100010111010011 (hexadecimal C5D3, octal 142723).
What is the square root of 50643?
About 225.0400, exactly 3√5627.
Is 50643 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50643?
50643 is a happy number: repeatedly adding the squares of its digits reaches 1.