Search a number
-
+
197015687161 is a prime number
BaseRepresentation
bin1011011101111100001…
…1001100111111111001
3200211112100202212220021
42313133003030333321
511211442003442121
6230301401530441
720143142465326
oct2673703147771
9624470685807
10197015687161
1176610245857
12322241a3a21
1315769c6aca7
14976d9ddb4d
1551d147d641
hex2ddf0ccff9

197015687161 has 2 divisors, whose sum is σ = 197015687162. Its totient is φ = 197015687160.

The previous prime is 197015687153. The next prime is 197015687191. The reversal of 197015687161 is 161786510791.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 98658810000 + 98356877161 = 314100^2 + 313619^2 .

It is a cyclic number.

It is not a de Polignac number, because 197015687161 - 23 = 197015687153 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 197015687099 and 197015687108.

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

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

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

Almost surely, 2197015687161 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 197015687161 in words is "one hundred ninety-seven billion, fifteen million, six hundred eighty-seven thousand, one hundred sixty-one".