Search a number
-
+
11092647701 is a prime number
BaseRepresentation
bin10100101010010110…
…00101111100010101
31001122001202212222202
422111023011330111
5140204204211301
65032413534245
7541612643522
oct122513057425
931561685882
1011092647701
114782568443
122196aa4385
13107a195785
1477330a149
1544dc9066b
hex2952c5f15

11092647701 has 2 divisors, whose sum is σ = 11092647702. Its totient is φ = 11092647700.

The previous prime is 11092647673. The next prime is 11092647739. The reversal of 11092647701 is 10774629011.

11092647701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an a-pointer prime, because the next prime (11092647739) can be obtained adding 11092647701 to its sum of digits (38).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9815657476 + 1276990225 = 99074^2 + 35735^2 .

It is a cyclic number.

It is not a de Polignac number, because 11092647701 - 226 = 11025538837 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11092647751) 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, 5546323850 + 5546323851.

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

Almost surely, 211092647701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21168, while the sum is 38.

The spelling of 11092647701 in words is "eleven billion, ninety-two million, six hundred forty-seven thousand, seven hundred one".