Search a number
-
+
11012010111 = 328091512431
BaseRepresentation
bin10100100000101110…
…11111000001111111
31001102110001002000100
422100113133001333
5140023033310421
65020413332143
7536613353514
oct122027370177
931373032010
1011012010111
114740aa1203
122173a97053
13106657111b
1476671930b
15446b62c26
hex2905df07f

11012010111 has 12 divisors (see below), whose sum is σ = 15925908960. Its totient is φ = 7332260640.

The previous prime is 11012010077. The next prime is 11012010131. The reversal of 11012010111 is 11101021011.

It is not a de Polignac number, because 11012010111 - 26 = 11012010047 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

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

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

Almost surely, 211012010111 is an apocalyptic number.

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

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

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

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

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

Adding to 11012010111 its reverse (11101021011), we get a palindrome (22113031122).

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

Divisors: 1 3 9 809 2427 7281 1512431 4537293 13611879 1223556679 3670670037 11012010111