Search a number
-
+
50156161 = 1141111211
BaseRepresentation
bin1011111101010…
…1001010000001
310111101012022121
42333111022001
5100314444121
64551004241
71146214606
oct277251201
9114335277
1050156161
1126348080
1214969681
13a511503
1469386ad
15460b141
hex2fd5281

50156161 has 8 divisors (see below), whose sum is σ = 56050848. Its totient is φ = 44484000.

The previous prime is 50156131. The next prime is 50156209. The reversal of 50156161 is 16165105.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 50156161 - 25 = 50156129 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (50156131) 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 in 7 ways as a sum of consecutive naturals, for example, 55155 + ... + 56056.

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

Almost surely, 250156161 is an apocalyptic number.

It is an amenable number.

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

50156161 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 111263.

The product of its (nonzero) digits is 900, while the sum is 25.

The square root of 50156161 is about 7082.1014536647. The cubic root of 50156161 is about 368.7862859629.

The spelling of 50156161 in words is "fifty million, one hundred fifty-six thousand, one hundred sixty-one".

Divisors: 1 11 41 451 111211 1223321 4559651 50156161