Search a number
-
+
2896564649071 is a prime number
BaseRepresentation
bin101010001001101000101…
…101001111110001101111
3101020220112120102000122211
4222021220231033301233
5334424131022232241
610054355144551251
7416161400165152
oct52115055176157
911226476360584
102896564649071
11a1747625a685
123a9459782527
131801b639ac42
14a02a1905c99
155052db1c781
hex2a268b4fc6f

2896564649071 has 2 divisors, whose sum is σ = 2896564649072. Its totient is φ = 2896564649070.

The previous prime is 2896564649053. The next prime is 2896564649081. The reversal of 2896564649071 is 1709464656982.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 2896564649071 - 29 = 2896564648559 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 22896564649071 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 156764160, while the sum is 67.

The spelling of 2896564649071 in words is "two trillion, eight hundred ninety-six billion, five hundred sixty-four million, six hundred forty-nine thousand, seventy-one".