WordGPT

The number 50763

50763 is a composite number with 4 divisors. Its prime factorisation is 3 × 16921. Divisors (4): 1, 3, 16921, 50763.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 50763: a semiprime: 3 × 16921, the product of two primes.

  2. 2

    50763 is composite. Its prime factorisation is

    50763=3×1692150763 = 3 \times 16921
  3. 3

    The divisors add up to 67688; without 50763 itself that is 16925, so 50763 is deficient (16925 is less than 50763). Euler's totient φ(50763) = 33840 numbers up to 50763 share no factor with it.

  4. 4

    The digits of 50763 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.

LaTeX source of the formulas on this page
\[ 50763 = 3 \times 16921 \]

50763 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors67688
Euler totient φ(n)33840
Square2576882169
Cube130810269544947
Square root225.306458
Digit sum / digital root21 / 3
Collatz steps to 183
Scientific notation5.0763 × 10410^{4}

50763 in other forms

FormValue
In wordsfifty thousand seven hundred and sixty-three
Binary (base 2)1100011001001011
Octal (base 8)143113
Hexadecimal (base 16)C64B
Base 32120122010
As time50763 seconds = 14 h 6 min 3 s

Is 50763 divisible by 2 to 12?

DivisorAnswerRule
2No (remainder 1)A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3Yes (50763 ÷ 3 = 16921)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 3)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 3)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 3)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 6)A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7.
8No (remainder 3)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 3)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 3)A number is divisible by 10 if the last digit is 0.
11No (remainder 9)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 3)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 50763 a prime number?

No. 50763 = 3 × 16921, so it is divisible by 3.

What are the factors of 50763?

1, 3, 16921, 50763.

What is 50763 in binary?

1100011001001011 (hexadecimal C64B, octal 143113).

What is the square root of 50763?

About 225.3065.

Is 50763 divisible by 3?

Yes. Its digits add up to 21, a multiple of 3.

What is special about the number 50763?

50763 is a semiprime: 3 × 16921, the product of two primes.

Find the next one

Nearby numbers

    50763: is it prime? Factors, square root, binary, Roman numeral | WordGPT