WordGPT

The number 50663

50663 is a composite number with 4 divisors. Its prime factorisation is 29 × 1747. Divisors (4): 1, 29, 1747, 50663.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 50663: a semiprime: 29 × 1747, the product of two primes.

  2. 2

    50663 is composite. Its prime factorisation is

    50663=29×174750663 = 29 \times 1747
  3. 3

    The divisors add up to 52440; without 50663 itself that is 1777, so 50663 is deficient (1777 is less than 50663). Euler's totient φ(50663) = 48888 numbers up to 50663 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 50663 = 29 \times 1747 \]

50663 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors52440
Euler totient φ(n)48888
Square2566739569
Cube130038726784247
Square root225.084429
Digit sum / digital root20 / 2
Collatz steps to 1109
Scientific notation5.0663 × 10410^{4}

50663 in other forms

FormValue
In wordsfifty thousand six hundred and sixty-three
Binary (base 2)1100010111100111
Octal (base 8)142747
Hexadecimal (base 16)C5E7
Base 32120111102
As time50663 seconds = 14 h 4 min 23 s

Is 50663 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).
3No (remainder 2)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 5)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 4)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 7)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 2)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 8)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 11)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 50663 a prime number?

No. 50663 = 29 × 1747, so it is divisible by 29.

What are the factors of 50663?

1, 29, 1747, 50663.

What is 50663 in binary?

1100010111100111 (hexadecimal C5E7, octal 142747).

What is the square root of 50663?

About 225.0844.

Is 50663 divisible by 3?

No. Its digits add up to 20, which is not a multiple of 3.

What is special about the number 50663?

50663 is a semiprime: 29 × 1747, the product of two primes.

Find the next one

Nearby numbers

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