Search a number
-
+
38716059061697 is a prime number
BaseRepresentation
bin10001100110110010010001…
…11100101000110111000001
312002002012220201112102022012
420303121020330220313001
520033310442104433242
6214201524554022305
711104100015121023
oct1063311074506701
9162065821472265
1038716059061697
11113774300186a6
124413521a17995
13187aba75653c4
1497bc1da78013
15472160aa7282
hex233648f28dc1

38716059061697 has 2 divisors, whose sum is σ = 38716059061698. Its totient is φ = 38716059061696.

The previous prime is 38716059061681. The next prime is 38716059061699. The reversal of 38716059061697 is 79616095061783.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 24314405969296 + 14401653092401 = 4930964^2 + 3794951^2 .

It is a cyclic number.

It is not a de Polignac number, because 38716059061697 - 24 = 38716059061681 is a prime.

Together with 38716059061699, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 238716059061697 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 102876480, while the sum is 68.

The spelling of 38716059061697 in words is "thirty-eight trillion, seven hundred sixteen billion, fifty-nine million, sixty-one thousand, six hundred ninety-seven".