Search a number
-
+
1101211112 = 23235984843
BaseRepresentation
bin100000110100011…
…0010010111101000
32211202010022122202
41001220302113220
54223402223422
6301134435332
736201066011
oct10150622750
92752108582
101101211112
11515672231
12268962b48
131471b6011
14a6376008
1566a24b92
hex41a325e8

1101211112 has 16 divisors (see below), whose sum is σ = 2154543840. Its totient is φ = 526666096.

The previous prime is 1101211079. The next prime is 1101211117. The reversal of 1101211112 is 2111121011.

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

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2992238 + ... + 2992605.

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

Almost surely, 21101211112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The square root of 1101211112 is about 33184.5010810770. The cubic root of 1101211112 is about 1032.6588270579.

Adding to 1101211112 its reverse (2111121011), we get a palindrome (3212332123).

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

Divisors: 1 2 4 8 23 46 92 184 5984843 11969686 23939372 47878744 137651389 275302778 550605556 1101211112