Search a number
-
+
110111010212220 = 223541271274960083
BaseRepresentation
bin11001000010010100110111…
…101001100100100101111100
3112102212111202121211212010120
4121002110313221210211330
5103413024322103242340
61030104144425534540
732123154323663253
oct3102246751444574
9472774677755116
10110111010212220
11320a28a9749736
1210424302644450
134959567b72874
141d2958936d79a
15cae3903574d0
hex642537a6497c

110111010212220 has 192 divisors, whose sum is σ = 317116622592000. Its totient is φ = 28530202060800.

The previous prime is 110111010212167. The next prime is 110111010212227. The reversal of 110111010212220 is 22212010111011.

It is a happy number.

It is a Harshad number since it is a multiple of its sum of digits (15).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110111010212227) by changing a digit.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1832618299 + ... + 1832678381.

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

Almost surely, 2110111010212220 is an apocalyptic number.

110111010212220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 16, while the sum is 15.

Adding to 110111010212220 its reverse (22212010111011), we get a palindrome (132323020323231).

The spelling of 110111010212220 in words is "one hundred ten trillion, one hundred eleven billion, ten million, two hundred twelve thousand, two hundred twenty".