Search a number
-
+
38511306157 is a prime number
BaseRepresentation
bin100011110111011100…
…111110010110101101
310200101220211001110111
4203313130332112231
51112332343244112
625405234540021
72532226462342
oct436734762655
9120356731414
1038511306157
11153726a0355
127569437611
13382981b52c
141c149ac7c9
151005e725a7
hex8f773e5ad

38511306157 has 2 divisors, whose sum is σ = 38511306158. Its totient is φ = 38511306156.

The previous prime is 38511306013. The next prime is 38511306179. The reversal of 38511306157 is 75160311583.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 25272732676 + 13238573481 = 158974^2 + 115059^2 .

It is a cyclic number.

It is not a de Polignac number, because 38511306157 - 223 = 38502917549 is a prime.

It is a super-2 number, since 2×385113061572 (a number of 22 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 238511306157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 75600, while the sum is 40.

The spelling of 38511306157 in words is "thirty-eight billion, five hundred eleven million, three hundred six thousand, one hundred fifty-seven".