Search a number
-
+
166776966313 is a prime number
BaseRepresentation
bin1001101101010010101…
…1101000110010101001
3120221110222021201002021
42123110223220302221
510213024400410223
6204341041104441
715022613552326
oct2332453506251
9527428251067
10166776966313
1164803282271
12283a5328121
131295b2b2369
1481019b3b4d
1545118ec65d
hex26d4ae8ca9

166776966313 has 2 divisors, whose sum is σ = 166776966314. Its totient is φ = 166776966312.

The previous prime is 166776966263. The next prime is 166776966329. The reversal of 166776966313 is 313669677661.

It is a happy number.

166776966313 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., 166160586384 + 616379929 = 407628^2 + 24827^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 166776966313 - 229 = 166240095401 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2166776966313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 166776966313 in words is "one hundred sixty-six billion, seven hundred seventy-six million, nine hundred sixty-six thousand, three hundred thirteen".