Search a number
-
+
50144050151 = 134498590723
BaseRepresentation
bin101110101100110100…
…010111101111100111
311210102121212200021122
4232230310113233213
51310143334101101
635011425004155
73423421252016
oct565464275747
9153377780248
1050144050151
111a2a2011068
12987518365b
1349618676c0
1425d990aa7d
15148734b51b
hexbacd17be7

50144050151 has 8 divisors (see below), whose sum is σ = 54121561200. Its totient is φ = 46183721472.

The previous prime is 50144050147. The next prime is 50144050157. The reversal of 50144050151 is 15105044105.

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

It is a cyclic number.

It is not a de Polignac number, because 50144050151 - 22 = 50144050147 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 50144050151.

It is a congruent number.

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

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

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

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

Almost surely, 250144050151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 8591185.

The product of its (nonzero) digits is 2000, while the sum is 26.

Adding to 50144050151 its reverse (15105044105), we get a palindrome (65249094256).

The spelling of 50144050151 in words is "fifty billion, one hundred forty-four million, fifty thousand, one hundred fifty-one".

Divisors: 1 13 449 5837 8590723 111679399 3857234627 50144050151