Search a number
-
+
136869975111169 is a prime number
BaseRepresentation
bin11111000111101110000110…
…001111110011011000000001
3122221121122022220012112110201
4133013232012033303120001
5120414434202112024134
61203033110514525201
740554346401514306
oct3707560617633001
9587548286175421
10136869975111169
113a67a259837063
1213426399896801
135b4aa24b03571
1425b27838cb0ad
1510c547eb69914
hex7c7b863f3601

136869975111169 has 2 divisors, whose sum is σ = 136869975111170. Its totient is φ = 136869975111168.

The previous prime is 136869975111161. The next prime is 136869975111239. The reversal of 136869975111169 is 961111579968631.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 113045696967025 + 23824278144144 = 10632295^2 + 4881012^2 .

It is a cyclic number.

It is not a de Polignac number, because 136869975111169 - 23 = 136869975111161 is a prime.

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

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

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

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

Almost surely, 2136869975111169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 132269760, while the sum is 73.

The spelling of 136869975111169 in words is "one hundred thirty-six trillion, eight hundred sixty-nine billion, nine hundred seventy-five million, one hundred eleven thousand, one hundred sixty-nine".