Search a number
-
+
11012100111 = 321223566679
BaseRepresentation
bin10100100000101111…
…10101000000001111
31001102110012122110200
422100113311000033
5140023044200421
65020415304543
7536614210065
oct122027650017
931373178420
1011012100111
114741052891
122173b1b153
1310665a308c
14766740035
15446b7e726
hex2905f500f

11012100111 has 6 divisors (see below), whose sum is σ = 15906366840. Its totient is φ = 7341400068.

The previous prime is 11012100109. The next prime is 11012100119. The reversal of 11012100111 is 11100121011.

It is not a de Polignac number, because 11012100111 - 21 = 11012100109 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1223566679 = 11012100111 / (1 + 1 + 0 + 1 + 2 + 1 + 0 + 0 + 1 + 1 + 1).

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

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 611783331 + ... + 611783348.

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

Almost surely, 211012100111 is an apocalyptic number.

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

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

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

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

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

Adding to 11012100111 its reverse (11100121011), we get a palindrome (22112221122).

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

Divisors: 1 3 9 1223566679 3670700037 11012100111