Search a number
-
+
106110500544 = 26321397271823
BaseRepresentation
bin110001011010010101…
…1011011111011000000
3101010220000121221011200
41202310223123323000
53214303242004134
6120425124141200
710444342241616
oct1426453337300
9333800557150
10106110500544
114100167a654
1218694237800
13a010757639
1451c87d56b6
152b608ed499
hex18b4adbec0

106110500544 has 168 divisors, whose sum is σ = 306924334080. Its totient is φ = 35048166912.

The previous prime is 106110500527. The next prime is 106110500581. The reversal of 106110500544 is 445005011601.

106110500544 is a `hidden beast` number, since 1 + 0 + 6 + 110 + 5 + 0 + 0 + 544 = 666.

It is a super-2 number, since 2×1061105005442 (a number of 23 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 23 ways as a sum of consecutive naturals, for example, 58205617 + ... + 58207439.

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

Almost surely, 2106110500544 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 106110500544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153462167040).

106110500544 is an abundant number, since it is smaller than the sum of its proper divisors (200813833536).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 2400, while the sum is 27.

The spelling of 106110500544 in words is "one hundred six billion, one hundred ten million, five hundred thousand, five hundred forty-four".