Search a number
-
+
11020110102707 is a prime number
BaseRepresentation
bin1010000001011101000110…
…1111111000000010110011
31110000111211102100202002012
42200113101233320002303
52421023141141241312
635234322500513135
72215114413220346
oct240272157700263
943014742322065
1011020110102707
11356966994a802
12129b9306ab7ab
1361c26586ba04
142a153a31c45d
151419d1e23322
hexa05d1bf80b3

11020110102707 has 2 divisors, whose sum is σ = 11020110102708. Its totient is φ = 11020110102706.

The previous prime is 11020110102653. The next prime is 11020110102709. The reversal of 11020110102707 is 70720101102011.

It is a strong prime.

It is an emirp because it is prime and its reverse (70720101102011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11020110102707 - 28 = 11020110102451 is a prime.

It is a super-3 number, since 3×110201101027073 (a number of 40 digits) contains 333 as substring.

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

It is a Chen prime.

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

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

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

Almost surely, 211020110102707 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 196, while the sum is 23.

Adding to 11020110102707 its reverse (70720101102011), we get a palindrome (81740211204718).

The spelling of 11020110102707 in words is "eleven trillion, twenty billion, one hundred ten million, one hundred two thousand, seven hundred seven".