Search a number
-
+
1101111022093 is a prime number
BaseRepresentation
bin10000000001011111010…
…101001101001000001101
310220021011022122112112011
4100001133111031020031
5121020033410201333
62201502102341221
7142360362155005
oct20013725151015
93807138575464
101101111022093
11394a84514375
1215949ba2a811
137cab0017ab4
143b418c75005
151d9982b29cd
hex1005f54d20d

1101111022093 has 2 divisors, whose sum is σ = 1101111022094. Its totient is φ = 1101111022092.

The previous prime is 1101111022087. The next prime is 1101111022097. The reversal of 1101111022093 is 3902201111011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 747986279044 + 353124743049 = 864862^2 + 594243^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101111022093 - 29 = 1101111021581 is a prime.

It is a super-2 number, since 2×11011110220932 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 21101111022093 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 22.

The spelling of 1101111022093 in words is "one trillion, one hundred one billion, one hundred eleven million, twenty-two thousand, ninety-three".