WordGPT

The number 50399

50399 is a composite number with 4 divisors. Its prime factorisation is 101 × 499. Divisors (4): 1, 101, 499, 50399.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 50399: a semiprime: 101 × 499, the product of two primes.

  2. 2

    50399 is composite. Its prime factorisation is

    50399=101×49950399 = 101 \times 499
  3. 3

    The divisors add up to 51000; without 50399 itself that is 601, so 50399 is deficient (601 is less than 50399). Euler's totient φ(50399) = 49800 numbers up to 50399 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 50399 = 101 \times 499 \]

50399 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors51000
Euler totient φ(n)49800
Square2540059201
Cube128016443671199
Square root224.497216
Digit sum / digital root26 / 8
Collatz steps to 170
Scientific notation5.0399 × 10410^{4}

50399 in other forms

FormValue
In wordsfifty thousand three hundred and ninety-nine
Binary (base 2)1100010011011111
Octal (base 8)142337
Hexadecimal (base 16)C4DF
Base 32120010122
As time50399 seconds = 13 h 59 min 59 s

Is 50399 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 4)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 6)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 8)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 9)A number is divisible by 10 if the last digit is 0.
11No (remainder 8)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 50399 a prime number?

No. 50399 = 101 × 499, so it is divisible by 101.

What are the factors of 50399?

1, 101, 499, 50399.

What is 50399 in binary?

1100010011011111 (hexadecimal C4DF, octal 142337).

What is the square root of 50399?

About 224.4972.

Is 50399 divisible by 3?

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

What is special about the number 50399?

50399 is a semiprime: 101 × 499, the product of two primes.

Find the next one

Nearby numbers

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