Search a number
-
+
136230161711569 is a prime number
BaseRepresentation
bin11110111110011010001110…
…011001011000000111010001
3122212100110212012102020002221
4132332122032121120013101
5120323443332344232234
61201423134453141041
740460206255404052
oct3676321631300721
9585313765366087
10136230161711569
113a452983856132
121334239962a781
135b025ab968a53
14258d809b70729
1510b39d48c3eb4
hex7be68e6581d1

136230161711569 has 2 divisors, whose sum is σ = 136230161711570. Its totient is φ = 136230161711568.

The previous prime is 136230161711563. The next prime is 136230161711627. The reversal of 136230161711569 is 965117161032631.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 125145836659600 + 11084325051969 = 11186860^2 + 3329313^2 .

It is a cyclic number.

It is not a de Polignac number, because 136230161711569 - 23 = 136230161711561 is a prime.

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

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

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

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

Almost surely, 2136230161711569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1224720, while the sum is 52.

The spelling of 136230161711569 in words is "one hundred thirty-six trillion, two hundred thirty billion, one hundred sixty-one million, seven hundred eleven thousand, five hundred sixty-nine".