Search a number
-
+
387135406037 is a prime number
BaseRepresentation
bin1011010001000110001…
…00010111111111010101
31101000021010120021200202
411220203010113333111
522320323130443122
6453503023150245
736653401441112
oct5504304277725
91330233507622
10387135406037
1113a201931566
1263042a45385
132a678328973
1414a47803909
15a10c2e1e92
hex5a23117fd5

387135406037 has 2 divisors, whose sum is σ = 387135406038. Its totient is φ = 387135406036.

The previous prime is 387135405991. The next prime is 387135406039. The reversal of 387135406037 is 730604531783.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 211166901841 + 175968504196 = 459529^2 + 419486^2 .

It is a cyclic number.

It is not a de Polignac number, because 387135406037 - 28 = 387135405781 is a prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 387135405982 and 387135406000.

It is a congruent number.

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

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

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

Almost surely, 2387135406037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1270080, while the sum is 47.

The spelling of 387135406037 in words is "three hundred eighty-seven billion, one hundred thirty-five million, four hundred six thousand, thirty-seven".