WordGPT

The number 50251

50251 is a composite number with 4 divisors. Its prime factorisation is 31 × 1621. Divisors (4): 1, 31, 1621, 50251.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 50251: a semiprime: 31 × 1621, the product of two primes.

  2. 2

    50251 is composite. Its prime factorisation is

    50251=31×162150251 = 31 \times 1621
  3. 3

    The divisors add up to 51904; without 50251 itself that is 1653, so 50251 is deficient (1653 is less than 50251). Euler's totient φ(50251) = 48600 numbers up to 50251 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 50251 = 31 \times 1621 \]

50251 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors51904
Euler totient φ(n)48600
Square2525163001
Cube126891965963251
Square root224.167348
Digit sum / digital root13 / 4
Collatz steps to 139
Scientific notation5.0251 × 10410^{4}

50251 in other forms

FormValue
In wordsfifty thousand two hundred and fifty-one
Binary (base 2)1100010001001011
Octal (base 8)142113
Hexadecimal (base 16)C44B
Base 32112221011
As time50251 seconds = 13 h 57 min 31 s

Is 50251 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 1)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 5)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 4)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 3)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 50251 a prime number?

No. 50251 = 31 × 1621, so it is divisible by 31.

What are the factors of 50251?

1, 31, 1621, 50251.

What is 50251 in binary?

1100010001001011 (hexadecimal C44B, octal 142113).

What is the square root of 50251?

About 224.1673.

Is 50251 divisible by 3?

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

What is special about the number 50251?

50251 is a semiprime: 31 × 1621, the product of two primes.

Find the next one

Nearby numbers

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