Search a number
BaseRepresentation
bin10000000001011001011…
…000000100110010011111
310220020220100122112100221
4100001121120010302133
5121014332321023241
62201444133102211
7142355040013144
oct20013130046237
93806810575327
101101011111071
11394a33083783
12159472487967
137ca95405951
143b4098a83cb
151d98e6295d1
hex10059604c9f

1101011111071 has 2 divisors, whose sum is σ = 1101011111072. Its totient is φ = 1101011111070.

The previous prime is 1101011111063. The next prime is 1101011111111. The reversal of 1101011111071 is 1701111101011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1101011111071 - 23 = 1101011111063 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1101011111021) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505555535 + 550505555536.

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

Almost surely, 21101011111071 is an apocalyptic number.

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

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

1101011111071 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 7, while the sum is 16.

Adding to 1101011111071 its reverse (1701111101011), we get a palindrome (2802122212082).

The spelling of 1101011111071 in words is "one trillion, one hundred one billion, eleven million, one hundred eleven thousand, seventy-one".