Search a number
-
+
38930442811313 is a prime number
BaseRepresentation
bin10001101101000001100110…
…01101101111011110110001
312002211201021111101021212212
420312200303031233132301
520100314021324430223
6214444222025501505
711125426443664064
oct1066406315573661
9162751244337785
1038930442811313
111144a343063879
124448b92641895
131895181835211
1498835a1a68db
15477a0bbb3278
hex23683336f7b1

38930442811313 has 2 divisors, whose sum is σ = 38930442811314. Its totient is φ = 38930442811312.

The previous prime is 38930442811241. The next prime is 38930442811363. The reversal of 38930442811313 is 31311824403983.

It is an a-pointer prime, because the next prime (38930442811363) can be obtained adding 38930442811313 to its sum of digits (50).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 37183372165489 + 1747070645824 = 6097817^2 + 1321768^2 .

It is a cyclic number.

It is not a de Polignac number, because 38930442811313 - 218 = 38930442549169 is a prime.

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

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

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

Almost surely, 238930442811313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 38930442811313 in words is "thirty-eight trillion, nine hundred thirty billion, four hundred forty-two million, eight hundred eleven thousand, three hundred thirteen".