WordGPT

The number 49763

49763 is a composite number with 4 divisors. Its prime factorisation is 7 × 7109. Divisors (4): 1, 7, 7109, 49763.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 49763: a semiprime: 7 × 7109, the product of two primes.

  2. 2

    49763 is composite. Its prime factorisation is

    49763=7×710949763 = 7 \times 7109
  3. 3

    The divisors add up to 56880; without 49763 itself that is 7117, so 49763 is deficient (7117 is less than 49763). Euler's totient φ(49763) = 42648 numbers up to 49763 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 49763 = 7 \times 7109 \]

49763 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors56880
Euler totient φ(n)42648
Square2476356169
Cube123230912037947
Square root223.076220
Digit sum / digital root29 / 2
Collatz steps to 1140
Scientific notation4.9763 × 10410^{4}

49763 in other forms

FormValue
In wordsforty-nine thousand seven hundred and sixty-three
Binary (base 2)1100001001100011
Octal (base 8)141143
Hexadecimal (base 16)C263
Base 32112021002
As time49763 seconds = 13 h 49 min 23 s

Is 49763 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.
7Yes (49763 ÷ 7 = 7109)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 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 10)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 49763 a prime number?

No. 49763 = 7 × 7109, so it is divisible by 7.

What are the factors of 49763?

1, 7, 7109, 49763.

What is 49763 in binary?

1100001001100011 (hexadecimal C263, octal 141143).

What is the square root of 49763?

About 223.0762.

Is 49763 divisible by 3?

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

What is special about the number 49763?

49763 is a semiprime: 7 × 7109, the product of two primes.

Find the next one

Nearby numbers

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