WordGPT

The number 49303

49303 is a composite number with 4 divisors. Its prime factorisation is 47 × 1049. Divisors (4): 1, 47, 1049, 49303.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 49303: a semiprime: 47 × 1049, the product of two primes.

  2. 2

    49303 is composite. Its prime factorisation is

    49303=47×104949303 = 47 \times 1049
  3. 3

    The divisors add up to 50400; without 49303 itself that is 1097, so 49303 is deficient (1097 is less than 49303). Euler's totient φ(49303) = 48208 numbers up to 49303 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 49303 = 47 \times 1049 \]

49303 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors50400
Euler totient φ(n)48208
Square2430785809
Cube119845032741127
Square root222.042789
Digit sum / digital root19 / 1
Collatz steps to 139
Scientific notation4.9303 × 10410^{4}

49303 in other forms

FormValue
In wordsforty-nine thousand three hundred and three
Binary (base 2)1100000010010111
Octal (base 8)140227
Hexadecimal (base 16)C097
Base 32111122001
As time49303 seconds = 13 h 41 min 43 s

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

Questions

Is 49303 a prime number?

No. 49303 = 47 × 1049, so it is divisible by 47.

What are the factors of 49303?

1, 47, 1049, 49303.

What is 49303 in binary?

1100000010010111 (hexadecimal C097, octal 140227).

What is the square root of 49303?

About 222.0428.

Is 49303 divisible by 3?

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

What is special about the number 49303?

49303 is a semiprime: 47 × 1049, the product of two primes.

Find the next one

Nearby numbers

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