Search a number
-
+
110200102111 = 1161164232641
BaseRepresentation
bin110011010100001110…
…0000001110011011111
3101112110000221012212101
41212220130001303133
53301142211231421
6122343014345531
710650601261351
oct1465034016337
9345400835771
10110200102111
11428100a2860
121943595b2a7
13a512abb818
1454959d10d1
152cee972191
hex19a8701cdf

110200102111 has 8 divisors (see below), whose sum is σ = 122189085648. Its totient is φ = 98539584000.

The previous prime is 110200102091. The next prime is 110200102123. The reversal of 110200102111 is 111201002011.

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

It is not a de Polignac number, because 110200102111 - 213 = 110200093919 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2110200102111 is an apocalyptic number.

110200102111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 164232713.

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

Adding to 110200102111 its reverse (111201002011), we get a palindrome (221401104122).

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

Divisors: 1 11 61 671 164232641 1806559051 10018191101 110200102111