Search a number
-
+
101111211201109 is a prime number
BaseRepresentation
bin10110111111010111001001…
…110100111001001001010101
3111021000010201011020022201011
4112333113021310321021111
5101223101230031413414
6555013503231132221
730204021033411304
oct2677271164711125
9437003634208634
10101111211201109
112a24302983952a
12b410044074071
134455991825315
141ad7b4724643b
15ba520462cdc4
hex5bf5c9d39255

101111211201109 has 2 divisors, whose sum is σ = 101111211201110. Its totient is φ = 101111211201108.

The previous prime is 101111211201103. The next prime is 101111211201137. The reversal of 101111211201109 is 901102112111101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 90956696042884 + 10154515158225 = 9537122^2 + 3186615^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101111211201109 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101111211201109 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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