Search a number
-
+
196701341 is a prime number
BaseRepresentation
bin10111011100101…
…10110010011101
3111201010110111212
423232112302131
5400323420331
631303554205
74605635204
oct1356266235
9451113455
10196701341
11a103a6a1
1255a5b965
13319a0a35
141c1a423b
1512406d2b
hexbb96c9d

196701341 has 2 divisors, whose sum is σ = 196701342. Its totient is φ = 196701340.

The previous prime is 196701317. The next prime is 196701343. The reversal of 196701341 is 143107691.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 177156100 + 19545241 = 13310^2 + 4421^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 196701341 - 26 = 196701277 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (196701343) 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, 98350670 + 98350671.

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

Almost surely, 2196701341 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4536, while the sum is 32.

The square root of 196701341 is about 14025.0255258235. The cubic root of 196701341 is about 581.5705954674.

The spelling of 196701341 in words is "one hundred ninety-six million, seven hundred one thousand, three hundred forty-one".