Search a number
-
+
50959546051 = 232215632437
BaseRepresentation
bin101111011101011011…
…001111011011000011
311212112110101011100111
4233131123033123003
51313331120433201
635224355532151
73452552665051
oct573533173303
9155473334314
1050959546051
111a680376217
129a622ba057
134a617b485b
142675d4b1d1
1514d3c34b51
hexbdd6cf6c3

50959546051 has 4 divisors (see below), whose sum is σ = 53175178512. Its totient is φ = 48743913592.

The previous prime is 50959546031. The next prime is 50959546063. The reversal of 50959546051 is 15064595905.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 50959546051 - 25 = 50959546019 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 50959545986 and 50959546004.

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

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

Almost surely, 250959546051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2215632460.

The product of its (nonzero) digits is 1215000, while the sum is 49.

The spelling of 50959546051 in words is "fifty billion, nine hundred fifty-nine million, five hundred forty-six thousand, fifty-one".

Divisors: 1 23 2215632437 50959546051