Search a number
-
+
111200220022 = 271783100141
BaseRepresentation
bin110011110010000001…
…1001011001101110110
3101122000201211110201111
41213210003023031312
53310214224020042
6123030142345234
711014434163123
oct1474403131566
9348021743644
10111200220022
1143183697191
121967488b21a
13a64206a578
14554c76d74a
152d5c678517
hex19e40cb376

111200220022 has 8 divisors (see below), whose sum is σ = 169149630672. Its totient is φ = 54817009800.

The previous prime is 111200220013. The next prime is 111200220023. The reversal of 111200220022 is 220022002111.

It is a happy number.

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

111200220022 is a modest number, since divided by 220022 gives 1112 as remainder.

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

It is a congruent number.

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

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, 391549929 + ... + 391550212.

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

Almost surely, 2111200220022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 783100214.

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

Adding to 111200220022 its reverse (220022002111), we get a palindrome (331222222133).

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

Divisors: 1 2 71 142 783100141 1566200282 55600110011 111200220022