Search a number
-
+
11001200110 = 258912360899
BaseRepresentation
bin10100011111011100…
…01111110111101110
31001101200200212110221
422033232033313232
5140012301400420
65015345521554
7536422441465
oct121756176756
931350625427
1011001200110
11473598851a
1221703432ba
131064257984
147651039dc
15445c29caa
hex28fb8fdee

11001200110 has 16 divisors (see below), whose sum is σ = 20024658000. Its totient is φ = 4351036096.

The previous prime is 11001200107. The next prime is 11001200117. The reversal of 11001200110 is 1100210011.

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

It is a congruent number.

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

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, 6179560 + ... + 6181339.

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

Almost surely, 211001200110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 12360995.

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

Adding to 11001200110 its reverse (1100210011), we get a palindrome (12101410121).

Subtracting from 11001200110 its reverse (1100210011), we obtain a palindrome (9900990099).

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

Divisors: 1 2 5 10 89 178 445 890 12360899 24721798 61804495 123608990 1100120011 2200240022 5500600055 11001200110