Search a number
-
+
1102012111 = 10110911011
BaseRepresentation
bin100000110101111…
…0101111011001111
32211210122000102101
41001223311323033
54224103341421
6301203535531
736210643204
oct10153657317
92753560371
101102012111
1151606a012
1226908a5a7
13147406795
14a6503cab
1566b32191
hex41af5ecf

1102012111 has 4 divisors (see below), whose sum is σ = 1112923224. Its totient is φ = 1091101000.

The previous prime is 1102012069. The next prime is 1102012129. The reversal of 1102012111 is 1112102011.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 1102012111 - 213 = 1102003919 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 (1102012511) 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 3 ways as a sum of consecutive naturals, for example, 5455405 + ... + 5455606.

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

Almost surely, 21102012111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10911112.

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

The square root of 1102012111 is about 33196.5677593332. The cubic root of 1102012111 is about 1032.9091448541.

Adding to 1102012111 its reverse (1112102011), we get a palindrome (2214114122).

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

Divisors: 1 101 10911011 1102012111