Search a number
-
+
12101011111 = 717101689169
BaseRepresentation
bin10110100010100011…
…01100011010100111
31011020100012001112201
423101101230122213
5144240324323421
65320434355331
7605605616530
oct132121543247
934210161481
1012101011111
11514a783832
12241872bb47
1311ab070607
1482b1d3687
154ac574b91
hex2d146c6a7

12101011111 has 8 divisors (see below), whose sum is σ = 14643240480. Its totient is φ = 9762160128.

The previous prime is 12101011081. The next prime is 12101011147. The reversal of 12101011111 is 11111010121.

12101011111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a Duffinian number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50844466 + ... + 50844703.

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

Almost surely, 212101011111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 101689193.

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

Adding to 12101011111 its reverse (11111010121), we get a palindrome (23212021232).

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

Divisors: 1 7 17 119 101689169 711824183 1728715873 12101011111