WordGPT

The number 49781

49781 is a composite number with 4 divisors. Its prime factorisation is 67 × 743. Divisors (4): 1, 67, 743, 49781.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 49781: a semiprime: 67 × 743, the product of two primes.

  2. 2

    49781 is composite. Its prime factorisation is

    49781=67×74349781 = 67 \times 743
  3. 3

    The divisors add up to 50592; without 49781 itself that is 811, so 49781 is deficient (811 is less than 49781). Euler's totient φ(49781) = 48972 numbers up to 49781 share no factor with it.

  4. 4

    The digits of 49781 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 39 steps to reach 1.

LaTeX source of the formulas on this page
\[ 49781 = 67 \times 743 \]

49781 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors50592
Euler totient φ(n)48972
Square2478147961
Cube123364683646541
Square root223.116561
Digit sum / digital root29 / 2
Collatz steps to 139
Scientific notation4.9781 × 10410^{4}

49781 in other forms

FormValue
In wordsforty-nine thousand seven hundred and eighty-one
Binary (base 2)1100001001110101
Octal (base 8)141165
Hexadecimal (base 16)C275
Base 32112021202
As time49781 seconds = 13 h 49 min 41 s

Is 49781 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 1)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 1)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 5)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 1)A number is divisible by 10 if the last digit is 0.
11No (remainder 6)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 5)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 49781 a prime number?

No. 49781 = 67 × 743, so it is divisible by 67.

What are the factors of 49781?

1, 67, 743, 49781.

What is 49781 in binary?

1100001001110101 (hexadecimal C275, octal 141165).

What is the square root of 49781?

About 223.1166.

Is 49781 divisible by 3?

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

What is special about the number 49781?

49781 is a semiprime: 67 × 743, the product of two primes.

Find the next one

Nearby numbers

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