Search a number
-
+
186363395698157 is a prime number
BaseRepresentation
bin101010010111111100011011…
…111111111110110111101101
3220102212011111110211021110122
4222113330123333332313231
5143411334213244320112
61500210055001214325
754153211451253656
oct5227743377766755
9812764443737418
10186363395698157
11544212aa42a337
1218a9a5841913a5
137ccacba271782
14340407215852d
151682b1625a872
hexa97f1bffeded

186363395698157 has 2 divisors, whose sum is σ = 186363395698158. Its totient is φ = 186363395698156.

The previous prime is 186363395698087. The next prime is 186363395698189. The reversal of 186363395698157 is 751896593363681.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 163117700236516 + 23245695461641 = 12771754^2 + 4821379^2 .

It is a cyclic number.

It is not a de Polignac number, because 186363395698157 - 212 = 186363395694061 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2186363395698157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5290790400, while the sum is 80.

The spelling of 186363395698157 in words is "one hundred eighty-six trillion, three hundred sixty-three billion, three hundred ninety-five million, six hundred ninety-eight thousand, one hundred fifty-seven".