Search a number
-
+
110102111011 = 1011090119911
BaseRepresentation
bin110011010001010011…
…0001110001100100011
3101112012012112202100101
41212202212032030203
53300442120023021
6122325154203231
710645301334124
oct1464246161443
9345165482311
10110102111011
114276a853682
1219408b83517
13a4c86cc519
1454869a404b
152ce6067a91
hex19a298e323

110102111011 has 4 divisors (see below), whose sum is σ = 111192231024. Its totient is φ = 109011991000.

The previous prime is 110102110991. The next prime is 110102111023. The reversal of 110102111011 is 110111201011.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 110102111011 - 215 = 110102078243 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2110102111011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1090120012.

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

Adding to 110102111011 its reverse (110111201011), we get a palindrome (220213312022).

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

Divisors: 1 101 1090119911 110102111011