Search a number
-
+
135681705816161 is a prime number
BaseRepresentation
bin11110110110011011011011…
…111000001011000001100001
3122210102001012100212222112112
4132312123123320023001201
5120241002113142104121
61200323152024005105
740402452104251331
oct3666333370130141
9583361170788475
10135681705816161
113a26131979a28a
1213274034900795
135a9296494341b
14257105b3210c1
1510a45d4c5875b
hex7b66dbe0b061

135681705816161 has 2 divisors, whose sum is σ = 135681705816162. Its totient is φ = 135681705816160.

The previous prime is 135681705816143. The next prime is 135681705816193. The reversal of 135681705816161 is 161618507186531.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 121342760393761 + 14338945422400 = 11015569^2 + 3786680^2 .

It is a cyclic number.

It is not a de Polignac number, because 135681705816161 - 234 = 135664525946977 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 135681705816161.

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

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

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

Almost surely, 2135681705816161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7257600, while the sum is 59.

The spelling of 135681705816161 in words is "one hundred thirty-five trillion, six hundred eighty-one billion, seven hundred five million, eight hundred sixteen thousand, one hundred sixty-one".