Search a number
-
+
50204701 is a prime number
BaseRepresentation
bin1011111110000…
…1000000011101
310111110122220101
42333201000131
5100323022301
64552021101
71146506251
oct277410035
9114418811
1050204701
1126380598
1214991791
13a52a631
14694c261
15461a701
hex2fe101d

50204701 has 2 divisors, whose sum is σ = 50204702. Its totient is φ = 50204700.

The previous prime is 50204683. The next prime is 50204711. The reversal of 50204701 is 10740205.

50204701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 46308025 + 3896676 = 6805^2 + 1974^2 .

It is a cyclic number.

It is not a de Polignac number, because 50204701 - 27 = 50204573 is a prime.

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (50204711) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25102350 + 25102351.

It is an arithmetic number, because the mean of its divisors is an integer number (25102351).

Almost surely, 250204701 is an apocalyptic number.

It is an amenable number.

50204701 is a deficient number, since it is larger than the sum of its proper divisors (1).

50204701 is an equidigital number, since it uses as much as digits as its factorization.

50204701 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 280, while the sum is 19.

The square root of 50204701 is about 7085.5275738649. The cubic root of 50204701 is about 368.9052152854.

Adding to 50204701 its reverse (10740205), we get a palindrome (60944906).

It can be divided in two parts, 50204 and 701, that added together give a palindrome (50905).

The spelling of 50204701 in words is "fifty million, two hundred four thousand, seven hundred one".