Search a number
-
+
196111229 is a prime number
BaseRepresentation
bin10111011000001…
…10101101111101
3111200000111000212
423230012231331
5400201024404
631243202205
74600626566
oct1354065575
9450014025
10196111229
11a07772a6
1255816365
1331825262
141c08d16d
151233c06e
hexbb06b7d

196111229 has 2 divisors, whose sum is σ = 196111230. Its totient is φ = 196111228.

The previous prime is 196111189. The next prime is 196111231. The reversal of 196111229 is 922111691.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 196056004 + 55225 = 14002^2 + 235^2 .

It is a cyclic number.

It is not a de Polignac number, because 196111229 - 220 = 195062653 is a prime.

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

Together with 196111231, 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 = 196111195 and 196111204.

It is a congruent number.

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

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

Almost surely, 2196111229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1944, while the sum is 32.

The square root of 196111229 is about 14003.9719008573. The cubic root of 196111229 is about 580.9884344527.

The spelling of 196111229 in words is "one hundred ninety-six million, one hundred eleven thousand, two hundred twenty-nine".