Search a number
-
+
3206450049557 is a prime number
BaseRepresentation
bin101110101010001111010…
…100001111001000010101
3102100112102000110102112212
4232222033110033020111
5410013302203041212
610453004532323205
7450441551503226
oct56521724171025
912315360412485
103206450049557
111026936508647
12439521773505
131a34a0231241
14b129b89924d
155861909de22
hex2ea8f50f215

3206450049557 has 2 divisors, whose sum is σ = 3206450049558. Its totient is φ = 3206450049556.

The previous prime is 3206450049547. The next prime is 3206450049563. The reversal of 3206450049557 is 7559400546023.

3206450049557 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., 3193133120356 + 13316929201 = 1786934^2 + 115399^2 .

It is a cyclic number.

It is not a de Polignac number, because 3206450049557 - 24 = 3206450049541 is a prime.

It is a congruent number.

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

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

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

Almost surely, 23206450049557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4536000, while the sum is 50.

The spelling of 3206450049557 in words is "three trillion, two hundred six billion, four hundred fifty million, forty-nine thousand, five hundred fifty-seven".