Search a number
-
+
50131916241 = 3111519148977
BaseRepresentation
bin101110101100000110…
…000101010111010001
311210101210001012200120
4232230012011113101
51310132232304431
635010312540453
73423213154131
oct565406052721
9153353035616
1050131916241
111a296183740
1298710b1729
13495c1a9784
1425d806cac1
151486251196
hexbac1855d1

50131916241 has 8 divisors (see below), whose sum is σ = 72919150944. Its totient is φ = 30382979520.

The previous prime is 50131916239. The next prime is 50131916257. The reversal of 50131916241 is 14261913105.

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

It is not a de Polignac number, because 50131916241 - 21 = 50131916239 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 1519148977 = 50131916241 / (5 + 0 + 1 + 3 + 1 + 9 + 1 + 6 + 2 + 4 + 1).

It is not an unprimeable number, because it can be changed into a prime (50131916201) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 759574456 + ... + 759574521.

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

Almost surely, 250131916241 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1519148991.

The product of its (nonzero) digits is 6480, while the sum is 33.

The spelling of 50131916241 in words is "fifty billion, one hundred thirty-one million, nine hundred sixteen thousand, two hundred forty-one".

Divisors: 1 3 11 33 1519148977 4557446931 16710638747 50131916241