WordGPT

The number 49213

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

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

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

  2. 2

    49213 is composite. Its prime factorisation is

    49213=29×169749213 = 29 \times 1697
  3. 3

    The divisors add up to 50940; without 49213 itself that is 1727, so 49213 is deficient (1727 is less than 49213). Euler's totient φ(49213) = 47488 numbers up to 49213 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 49213 = 29 \times 1697 \]

49213 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors50940
Euler totient φ(n)47488
Square2421919369
Cube119189917906597
Square root221.840032
Digit sum / digital root19 / 1
Collatz steps to 1114
Scientific notation4.9213 × 10410^{4}

49213 in other forms

FormValue
In wordsforty-nine thousand two hundred and thirteen
Binary (base 2)1100000000111101
Octal (base 8)140075
Hexadecimal (base 16)C03D
Base 32111111201
As time49213 seconds = 13 h 40 min 13 s

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

Questions

Is 49213 a prime number?

No. 49213 = 29 × 1697, so it is divisible by 29.

What are the factors of 49213?

1, 29, 1697, 49213.

What is 49213 in binary?

1100000000111101 (hexadecimal C03D, octal 140075).

What is the square root of 49213?

About 221.8400.

Is 49213 divisible by 3?

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

What is special about the number 49213?

49213 is a semiprime: 29 × 1697, the product of two primes.

Find the next one

Nearby numbers

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