Search a number
-
+
166585935913 is a prime number
BaseRepresentation
bin1001101100100101001…
…0111010100000101001
3120220222122211100122021
42123021102322200221
510212131444422123
6204310054424441
715015104043355
oct2331122724051
9526878740567
10166585935913
1164715466301
1228351362121
131292a848917
1480c4488465
1544eec65c5d
hex26c94ba829

166585935913 has 2 divisors, whose sum is σ = 166585935914. Its totient is φ = 166585935912.

The previous prime is 166585935851. The next prime is 166585935931. The reversal of 166585935913 is 319539585661.

Together with next prime (166585935931) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 165093504489 + 1492431424 = 406317^2 + 38632^2 .

It is a cyclic number.

It is not a de Polignac number, because 166585935913 - 221 = 166583838761 is a prime.

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

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

Almost surely, 2166585935913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 26244000, while the sum is 61.

The spelling of 166585935913 in words is "one hundred sixty-six billion, five hundred eighty-five million, nine hundred thirty-five thousand, nine hundred thirteen".