Search a number
-
+
38907565290701 is a prime number
BaseRepresentation
bin10001101100010110111111…
…00110111011010011001101
312002202112020010021211102122
420312023133212323103031
520044430143203300301
6214425515545102325
711123656511163212
oct1066133746732315
9162675203254378
1038907565290701
1111440673319a48
124444668a879a5
131892c76c5a683
149871c9a7bb09
1547711d4e881b
hex2362df9bb4cd

38907565290701 has 2 divisors, whose sum is σ = 38907565290702. Its totient is φ = 38907565290700.

The previous prime is 38907565290647. The next prime is 38907565290721. The reversal of 38907565290701 is 10709256570983.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 38511891582025 + 395673708676 = 6205795^2 + 629026^2 .

It is a cyclic number.

It is not a de Polignac number, because 38907565290701 - 226 = 38907498181837 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 238907565290701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28576800, while the sum is 62.

The spelling of 38907565290701 in words is "thirty-eight trillion, nine hundred seven billion, five hundred sixty-five million, two hundred ninety thousand, seven hundred one".