Search a number
-
+
12101001111 = 321344555679
BaseRepresentation
bin10110100010100011…
…01001111110010111
31011020100011112211100
423101101221332113
5144240324013421
65320434241143
7605605545423
oct132121517627
934210145740
1012101001111
11514a777271
1224187261b3
1311ab068bb4
1482b1cdb83
154ac571c26
hex2d1469f97

12101001111 has 6 divisors (see below), whose sum is σ = 17479223840. Its totient is φ = 8067334068.

The previous prime is 12101001103. The next prime is 12101001127. The reversal of 12101001111 is 11110010121.

It is not a de Polignac number, because 12101001111 - 23 = 12101001103 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1344555679 = 12101001111 / (1 + 2 + 1 + 0 + 1 + 0 + 0 + 1 + 1 + 1 + 1).

It is a Duffinian number.

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

It is a congruent number.

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

Almost surely, 212101001111 is an apocalyptic number.

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

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

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

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

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

Adding to 12101001111 its reverse (11110010121), we get a palindrome (23211011232).

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

Divisors: 1 3 9 1344555679 4033667037 12101001111