Search a number
-
+
11173077029 is a prime number
BaseRepresentation
bin10100110011111011…
…11010000000100101
31001211200010010021202
422121331322000211
5140340301431104
65044405452245
7543610405412
oct123175720045
931750103252
1011173077029
114813a02164
1221b9a11085
131090a463aa
1477dc85109
15455d7b51e
hex299f7a025

11173077029 has 2 divisors, whose sum is σ = 11173077030. Its totient is φ = 11173077028.

The previous prime is 11173076989. The next prime is 11173077061. The reversal of 11173077029 is 92077037111.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10945972129 + 227104900 = 104623^2 + 15070^2 .

It is a cyclic number.

It is not a de Polignac number, because 11173077029 - 224 = 11156299813 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 11173076983 and 11173077001.

It is a congruent number.

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

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

Almost surely, 211173077029 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11173077029 in words is "eleven billion, one hundred seventy-three million, seventy-seven thousand, twenty-nine".