Search a number
-
+
50511006051 = 31121031350959
BaseRepresentation
bin101111000010101100…
…001100100101100011
311211101012100222010220
4233002230030211203
51311421304143201
635112054054123
73435465316212
oct570254144543
9154335328126
1050511006051
111a470167500
12995804a343
1349bc8a957c
14263254d079
1514a9684036
hexbc2b0c963

50511006051 has 24 divisors (see below), whose sum is σ = 74745914880. Its totient is φ = 30315497520.

The previous prime is 50511006047. The next prime is 50511006053. The reversal of 50511006051 is 15060011505.

It is not a de Polignac number, because 50511006051 - 22 = 50511006047 is a prime.

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

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

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

Almost surely, 250511006051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1351087 (or 1351076 counting only the distinct ones).

The product of its (nonzero) digits is 750, while the sum is 24.

Adding to 50511006051 its reverse (15060011505), we get a palindrome (65571017556).

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

Divisors: 1 3 11 33 103 121 309 363 1133 3399 12463 37389 1350959 4052877 14860549 44581647 139148777 163466039 417446331 490398117 1530636547 4591909641 16837002017 50511006051