Search a number
-
+
111100010110102 = 21333291283591863
BaseRepresentation
bin11001010000101101111100…
…101000110001110010010110
3112120101001112201122012022001
4121100231330220301302112
5104030230310042010402
61032142350130025514
732254465551262606
oct3120557450616226
9476331481565261
10111100010110102
1132444282377042
1210563b1471829a
1349cb8bc1a9430
141d613aa8bac06
15cc9e7600e187
hex650b7ca31c96

111100010110102 has 16 divisors (see below), whose sum is σ = 179523158099040. Its totient is φ = 51261524600832.

The previous prime is 111100010110087. The next prime is 111100010110123. The reversal of 111100010110102 is 201011010001111.

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

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 641709378 + ... + 641882485.

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

Almost surely, 2111100010110102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1283595207.

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 111100010110102 its reverse (201011010001111), we get a palindrome (312111020111213).

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

Divisors: 1 2 13 26 3329 6658 43277 86554 1283591863 2567183726 16686694219 33373388438 4273077311927 8546154623854 55550005055051 111100010110102