Search a number
-
+
11001110010173 is a prime number
BaseRepresentation
bin1010000000010110010101…
…0000010001100100111101
31102221200210021100001000022
42200011211100101210331
52420220233130311143
635221501250541525
72213542522130513
oct240054520214475
942850707301008
1011001110010173
1135615a9890a98
1212981095978a5
1361a52839b0ca
142a0656b5c4b3
1514126dd6b268
hexa016541193d

11001110010173 has 2 divisors, whose sum is σ = 11001110010174. Its totient is φ = 11001110010172.

The previous prime is 11001110010067. The next prime is 11001110010203. The reversal of 11001110010173 is 37101001110011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5919863687929 + 5081246322244 = 2433077^2 + 2254162^2 .

It is a cyclic number.

It is not a de Polignac number, because 11001110010173 - 220 = 11001108961597 is a prime.

It is a congruent number.

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

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

Almost surely, 211001110010173 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21, while the sum is 17.

Adding to 11001110010173 its reverse (37101001110011), we get a palindrome (48102111120184).

The spelling of 11001110010173 in words is "eleven trillion, one billion, one hundred ten million, ten thousand, one hundred seventy-three".