Search a number
-
+
50011505031 = 331379531263
BaseRepresentation
bin101110100100111010…
…110000000110000111
311210002101110200120010
4232210322300012013
51304410421130111
634550332041303
73420221531055
oct564472600607
9153071420503
1050011505031
111a234210a44
129838903233
13494026a637
1425c60871d5
15147a8b8aa6
hexba4eb0187

50011505031 has 8 divisors (see below), whose sum is σ = 66684257280. Its totient is φ = 33339878072.

The previous prime is 50011505009. The next prime is 50011505069. The reversal of 50011505031 is 13050511005.

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 50011505031 - 210 = 50011504007 is a prime.

It is a super-2 number, since 2×500115050312 (a number of 22 digits) contains 22 as substring.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (50011506031) 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, 171495 + ... + 359768.

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

Almost surely, 250011505031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 562645.

The product of its (nonzero) digits is 375, while the sum is 21.

The spelling of 50011505031 in words is "fifty billion, eleven million, five hundred five thousand, thirty-one".

Divisors: 1 3 31379 94137 531263 1593789 16670501677 50011505031