Search a number
-
+
11702556052 = 22111283207301
BaseRepresentation
bin10101110011000011…
…01101010110010100
31010012120102102221221
422321201231112110
5142431323243202
65213122220124
7563000041135
oct127141552624
933176372857
1011702556052
114a65873630
1223271b4644
1311466502a5
147d0311c8c
154875b9037
hex2b986d594

11702556052 has 24 divisors (see below), whose sum is σ = 22358764512. Its totient is φ = 5315172000.

The previous prime is 11702556049. The next prime is 11702556053. The reversal of 11702556052 is 25065520711.

11702556052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a congruent number.

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

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

Almost surely, 211702556052 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 21000, while the sum is 34.

The spelling of 11702556052 in words is "eleven billion, seven hundred two million, five hundred fifty-six thousand, fifty-two".

Divisors: 1 2 4 11 22 44 1283 2566 5132 14113 28226 56452 207301 414602 829204 2280311 4560622 9121244 265967183 531934366 1063868732 2925639013 5851278026 11702556052