Search a number
-
+
39011022022157 is a prime number
BaseRepresentation
bin10001101111010111101100…
…00111000010011000001101
312010010102021012101022210022
420313223312013002120031
520103124033114202112
6214545225513551525
711134311330661043
oct1067536607023015
9163112235338708
1039011022022157
1111480532a095a9
1244607204155a5
13189c953967233
1498c201c36393
15479b75e44d72
hex237af61c260d

39011022022157 has 2 divisors, whose sum is σ = 39011022022158. Its totient is φ = 39011022022156.

The previous prime is 39011022022139. The next prime is 39011022022207. The reversal of 39011022022157 is 75122022011093.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 38990208477796 + 20813544361 = 6244214^2 + 144269^2 .

It is a cyclic number.

It is not a de Polignac number, because 39011022022157 - 222 = 39011017827853 is a prime.

It is a congruent number.

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

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

Almost surely, 239011022022157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15120, while the sum is 35.

The spelling of 39011022022157 in words is "thirty-nine trillion, eleven billion, twenty-two million, twenty-two thousand, one hundred fifty-seven".