Search a number
-
+
196501141 is a prime number
BaseRepresentation
bin10111011011001…
…01111010010101
3111200202021220001
423231211322111
5400301014031
631255411301
74604142424
oct1355457225
9450667801
10196501141
11a0a13241
1255983b31
1331930885
141c1512bb
15123b7861
hexbb65e95

196501141 has 2 divisors, whose sum is σ = 196501142. Its totient is φ = 196501140.

The previous prime is 196501139. The next prime is 196501159. The reversal of 196501141 is 141105691.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 118178641 + 78322500 = 10871^2 + 8850^2 .

It is an emirp because it is prime and its reverse (141105691) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 196501141 - 21 = 196501139 is a prime.

It is a super-2 number, since 2×1965011412 = 77225396828603762, which contains 22 as substring.

Together with 196501139, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2196501141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 28.

The square root of 196501141 is about 14017.8864669393. The cubic root of 196501141 is about 581.3732235610.

The spelling of 196501141 in words is "one hundred ninety-six million, five hundred one thousand, one hundred forty-one".