Search a number
-
+
50505060052 = 22317313712697
BaseRepresentation
bin101111000010010101…
…100000111011010100
311211100210011212202201
4233002111200323110
51311413243410202
635111322414244
73435363633016
oct570225407324
9154323155681
1050505060052
111a467876157
129956061384
1349bb5a7025
1426318421b6
1514a8dac387
hexbc2560ed4

50505060052 has 24 divisors (see below), whose sum is σ = 88697917224. Its totient is φ = 25162862592.

The previous prime is 50505060041. The next prime is 50505060119. The reversal of 50505060052 is 25006050505.

It can be written as a sum of positive squares in 4 ways, for example, as 5487253776 + 45017806276 = 74076^2 + 212174^2 .

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

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

It is a congruent number.

It is an unprimeable number.

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, 3971368 + ... + 3984064.

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

Almost surely, 250505060052 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 7500, while the sum is 28.

The spelling of 50505060052 in words is "fifty billion, five hundred five million, sixty thousand, fifty-two".

Divisors: 1 2 4 317 634 1268 3137 6274 12548 12697 25394 50788 994429 1988858 3977716 4024949 8049898 16099796 39830489 79660978 159321956 12626265013 25252530026 50505060052