Search a number
BaseRepresentation
bin10100100000101000…
…00011100011001000
31001102101100101211002
422100110003203020
5140022321023422
65020342154132
7536602620521
oct122024034310
931371311732
1011011111112
114740537831
122173722948
131066317b81
14766563848
15446a36692
hex2905038c8

11011111112 has 64 divisors (see below), whose sum is σ = 21235737600. Its totient is φ = 5351028480.

The previous prime is 11011111051. The next prime is 11011111117. The reversal of 11011111112 is 21111111011.

Adding to 11011111112 its reverse (21111111011), we get a palindrome (32122222123).

It is a happy number.

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

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18139913 + ... + 18140519.

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

Almost surely, 211011111112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The spelling of 11011111112 in words is "eleven billion, eleven million, one hundred eleven thousand, one hundred twelve".