Search a number
-
+
1100201011111 = 5591196780721
BaseRepresentation
bin10000000000101001000…
…101110010011110100111
310220011210220022012010201
4100000221011302132213
5121011202424323421
62201231513531331
7142326002202526
oct20005105623647
93804726265121
101100201011111
11394657874684
12159287113b47
137c996627867
143b3700704bd
151d943459b91
hex100291727a7

1100201011111 has 4 divisors (see below), whose sum is σ = 1100397797424. Its totient is φ = 1100004224800.

The previous prime is 1100201011109. The next prime is 1100201011139. The reversal of 1100201011111 is 1111101020011.

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 1100201011111 - 21 = 1100201011109 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 (1100201011181) 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 3 ways as a sum of consecutive naturals, for example, 98384770 + ... + 98395951.

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

Almost surely, 21100201011111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 196786312.

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

Adding to 1100201011111 its reverse (1111101020011), we get a palindrome (2211302031122).

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

Divisors: 1 5591 196780721 1100201011111