Search a number
-
+
110100111111022 = 255463999253849
BaseRepresentation
bin11001000010001010101110…
…000000110011001101101110
3112102211110122001021011000211
4121002022232000303031232
5103412340011421023042
61030055143124213034
732122320251105104
oct3102125600631556
9472743561234024
10110100111111022
113209921646668a
121042218053a17a
13495851bb14b66
141d28c33a45c74
15cade53599017
hex6422ae03336e

110100111111022 has 8 divisors (see below), whose sum is σ = 165150466092000. Its totient is φ = 55049955747024.

The previous prime is 110100111111017. The next prime is 110100111111047. The reversal of 110100111111022 is 220111111001011.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2110100111111022 is an apocalyptic number.

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

110100111111022 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 99808490.

The product of its (nonzero) digits is 4, while the sum is 13.

Adding to 110100111111022 its reverse (220111111001011), we get a palindrome (330211222112033).

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

Divisors: 1 2 554639 1109278 99253849 198507698 55050055555511 110100111111022