Search a number
-
+
11010021111 = 3273157106739
BaseRepresentation
bin10100100000011111…
…11001011011110111
31001102022022000121200
422100033321123313
5140022031133421
65020302543543
7536560430625
oct122017713367
931368260550
1011010021111
11473a962901
122173297bb3
1310660259bb
1476635c515
154468bd726
hex2903f96f7

11010021111 has 24 divisors (see below), whose sum is σ = 16224053040. Its totient is φ = 7193287296.

The previous prime is 11010021047. The next prime is 11010021137. The reversal of 11010021111 is 11112001011.

It is not a de Polignac number, because 11010021111 - 26 = 11010021047 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 = 11010021093 and 11010021102.

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 49780 + ... + 156518.

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

Almost surely, 211010021111 is an apocalyptic number.

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

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

11010021111 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 11010021111 its reverse (11112001011), we get a palindrome (22122022122).

The spelling of 11010021111 in words is "eleven billion, ten million, twenty-one thousand, one hundred eleven".

Divisors: 1 3 9 73 157 219 471 657 1413 11461 34383 103149 106739 320217 960651 7791947 16758023 23375841 50274069 70127523 150822207 1223335679 3670007037 11010021111