Search a number
-
+
111011010102 = 2326167278339
BaseRepresentation
bin110011101100011000…
…1011001011000110110
3101121112112210121111200
41213120301121120312
53304322304310402
6122555303113330
711006646005526
oct1473061313066
9347475717450
10111011010102
1143096903a53
1219621442846
13a611ac0635
145531599686
152d4ac5121c
hex19d8c59636

111011010102 has 12 divisors (see below), whose sum is σ = 240523855260. Its totient is φ = 37003670028.

The previous prime is 111011010101. The next prime is 111011010113. The reversal of 111011010102 is 201010110111.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (111011010101) 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 5 ways as a sum of consecutive naturals, for example, 3083639152 + ... + 3083639187.

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

Almost surely, 2111011010102 is an apocalyptic number.

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

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

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

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

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

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

Adding to 111011010102 its reverse (201010110111), we get a palindrome (312021120213).

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

Divisors: 1 2 3 6 9 18 6167278339 12334556678 18501835017 37003670034 55505505051 111011010102