Search a number
-
+
102012101111 = 2943322133671
BaseRepresentation
bin101111100000001100…
…1010010000111110111
3100202022101202200002002
41133000121102013313
53132410044213421
6114510321205515
710240645360334
oct1370031220767
9322271680062
10102012101111
113a299198488
121792b79089b
139809632b0b
144d1a38998b
1529c0bdcb0b
hex17c06521f7

102012101111 has 16 divisors (see below), whose sum is σ = 105850100160. Its totient is φ = 98195811840.

The previous prime is 102012101077. The next prime is 102012101119. The reversal of 102012101111 is 111101210201.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-102012101111 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 2102012101111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6346.

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 102012101111 its reverse (111101210201), we get a palindrome (213113311312).

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

Divisors: 1 29 433 2213 3671 12557 64177 106459 958229 1589543 8123923 27788641 46096747 235593767 3517658659 102012101111