Search a number
-
+
196602141 = 365534047
BaseRepresentation
bin10111011011111…
…10100100011101
3111200221102102210
423231332210131
5400312232031
631301511033
74605043041
oct1355764435
9450842383
10196602141
11a0a8210a
1255a12479
1331967838
141c17a021
15123d7746
hexbb7e91d

196602141 has 4 divisors (see below), whose sum is σ = 262136192. Its totient is φ = 131068092.

The previous prime is 196602113. The next prime is 196602163. The reversal of 196602141 is 141206691.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 141206691 = 347068897.

It is not a de Polignac number, because 196602141 - 27 = 196602013 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (196602181) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32767021 + ... + 32767026.

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

Almost surely, 2196602141 is an apocalyptic number.

It is an amenable number.

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

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

196602141 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 65534050.

The product of its (nonzero) digits is 2592, while the sum is 30.

The square root of 196602141 is about 14021.4885443736. The cubic root of 196602141 is about 581.4728135478.

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

Divisors: 1 3 65534047 196602141