Search a number
-
+
135412151050157 is a prime number
BaseRepresentation
bin11110110010100000011001…
…001010010101111110101101
3122202110021102122001002101112
4132302200121022111332231
5120222043041132101112
61155555252225521405
740344130223454062
oct3662403112257655
9582407378032345
10135412151050157
113a167a750979a3
121322b9474a3265
135a734074c8197
142561da9804c69
15109c5aa31ea22
hex7b2819295fad

135412151050157 has 2 divisors, whose sum is σ = 135412151050158. Its totient is φ = 135412151050156.

The previous prime is 135412151050139. The next prime is 135412151050201. The reversal of 135412151050157 is 751050151214531.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 133272501785641 + 2139649264516 = 11544371^2 + 1462754^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-135412151050157 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2135412151050157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 105000, while the sum is 41.

The spelling of 135412151050157 in words is "one hundred thirty-five trillion, four hundred twelve billion, one hundred fifty-one million, fifty thousand, one hundred fifty-seven".