Search a number
-
+
1101011111021 is a prime number
BaseRepresentation
bin10000000001011001011…
…000000100110001101101
310220020220100122112022002
4100001121120010301231
5121014332321023041
62201444133102045
7142355040013043
oct20013130046155
93806810575262
101101011111021
11394a33083738
12159472487925
137ca95405913
143b4098a8393
151d98e62959b
hex10059604c6d

1101011111021 has 2 divisors, whose sum is σ = 1101011111022. Its totient is φ = 1101011111020.

The previous prime is 1101011110957. The next prime is 1101011111023. The reversal of 1101011111021 is 1201111101011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 706080561796 + 394930549225 = 840286^2 + 628435^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101011111021 - 26 = 1101011110957 is a prime.

Together with 1101011111023, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 21101011111021 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1101011111021 its reverse (1201111101011), we get a palindrome (2302122212032).

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