Search a number
-
+
1101056111 is a prime number
BaseRepresentation
bin100000110100000…
…1100100001101111
32211201211110000222
41001220030201233
54223332243421
6301131241555
736166552061
oct10150144157
92751743028
101101056111
11515576831
122688a92bb
131471605bc
14a6335731
15669e3cab
hex41a0c86f

1101056111 has 2 divisors, whose sum is σ = 1101056112. Its totient is φ = 1101056110.

The previous prime is 1101056093. The next prime is 1101056149. The reversal of 1101056111 is 1116501011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1101056111 - 214 = 1101039727 is a prime.

It is a Sophie Germain prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1101056111.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1101056611) 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 as a sum of consecutive naturals, namely, 550528055 + 550528056.

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

Almost surely, 21101056111 is an apocalyptic number.

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

1101056111 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 30, while the sum is 17.

The square root of 1101056111 is about 33182.1655562141. The cubic root of 1101056111 is about 1032.6103741441.

Adding to 1101056111 its reverse (1116501011), we get a palindrome (2217557122).

Subtracting 1101056111 from its reverse (1116501011), we obtain a square (15444900 = 39302).

The spelling of 1101056111 in words is "one billion, one hundred one million, fifty-six thousand, one hundred eleven".