Search a number
-
+
105611105611052 = 2273361681868531
BaseRepresentation
bin11000000000110110000000…
…011011110010110100101100
3111211221022201112110012112222
4120000312000123302310230
5102320313021014023202
61012341023325214512
731150102435660256
oct3000660033626454
9454838645405488
10105611105611052
1130718466929188
12ba18181701438
1346c111391b7a2
141c11867760cd6
15c322c1d104a2
hex600d806f2d2c

105611105611052 has 12 divisors (see below), whose sum is σ = 187351207899576. Its totient is φ = 52082189068320.

The previous prime is 105611105610961. The next prime is 105611105611069. The reversal of 105611105611052 is 250116501116501.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 180840933974 + ... + 180840934557.

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

Almost surely, 2105611105611052 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 9000, while the sum is 35.

Adding to 105611105611052 its reverse (250116501116501), we get a palindrome (355727606727553).

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

Divisors: 1 2 4 73 146 292 361681868531 723363737062 1446727474124 26402776402763 52805552805526 105611105611052