Cookie Consent by FreePrivacyPolicy.com
Search a number
-
+
36052844825057 is a prime number
BaseRepresentation
bin10000011001010001101010…
…00000100100100111100001
311201122121200202002120100012
420030220311000210213201
514211142211233400212
6204402240454134305
710410506050453634
oct1014506500444741
9151577622076305
1036052844825057
111053aa2000a745
124063348951395
1317169cba31aa8
148c8d7763bc1b
15427c3d247922
hex20ca350249e1

36052844825057 has 2 divisors, whose sum is σ = 36052844825058. Its totient is φ = 36052844825056.

The previous prime is 36052844825051. The next prime is 36052844825071. The reversal of 36052844825057 is 75052844825063.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 35662920760336 + 389924064721 = 5971844^2 + 624439^2 .

It is a cyclic number.

It is not a de Polignac number, because 36052844825057 - 216 = 36052844759521 is a prime.

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

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

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

Almost surely, 236052844825057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 64512000, while the sum is 59.

The spelling of 36052844825057 in words is "thirty-six trillion, fifty-two billion, eight hundred forty-four million, eight hundred twenty-five thousand, fifty-seven".