Search a number
-
+
110110112011022 = 21011912853924421
BaseRepresentation
bin11001000010010100000010…
…000111001101001100001110
3112102212102110000201111201112
4121002110002013031030032
5103413021002133323042
61030103515342212022
732123123136256004
oct3102240207151416
9472772400644645
10110110112011022
11320a24887358a2
12104240b1884012
134959453a58b76
141d29501d60a74
15cae33b583982
hex6425021cd30e

110110112011022 has 16 divisors (see below), whose sum is σ = 167673767641344. Its totient is φ = 54224563980000.

The previous prime is 110110112010979. The next prime is 110110112011057. The reversal of 110110112011022 is 220110211011011.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1426923629 + ... + 1427000792.

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

Almost surely, 2110110112011022 is an apocalyptic number.

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

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

110110112011022 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2853924715.

The product of its (nonzero) digits is 8, while the sum is 14.

Adding to 110110112011022 its reverse (220110211011011), we get a palindrome (330220323022033).

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

Divisors: 1 2 101 191 202 382 19291 38582 2853924421 5707848842 288246366521 545099564411 576492733042 1090199128822 55055056005511 110110112011022