Search a number
-
+
10011102111 = 322389465611
BaseRepresentation
bin10010101001011010…
…10100101110011111
3221211200122200100200
421110231110232133
5131000320231421
64333220354543
7503040651423
oct112455245637
927750580320
1010011102111
11427800820a
121b34845a53
13c370a687a
146ad812b83
153d8d52726
hex254b54b9f

10011102111 has 12 divisors (see below), whose sum is σ = 14466564840. Its totient is φ = 6671260080.

The previous prime is 10011102083. The next prime is 10011102113. The reversal of 10011102111 is 11120111001.

It is not a de Polignac number, because 10011102111 - 226 = 9943993247 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 = 10011102093 and 10011102102.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10011102113) 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, 211305 + ... + 254306.

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

Almost surely, 210011102111 is an apocalyptic number.

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

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

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

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

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

Adding to 10011102111 its reverse (11120111001), we get a palindrome (21131213112).

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

Divisors: 1 3 9 2389 7167 21501 465611 1396833 4190499 1112344679 3337034037 10011102111