Search a number
-
+
196949057 is a prime number
BaseRepresentation
bin10111011110100…
…11010001000001
3111201121001022112
423233103101001
5400404332212
631313145105
74611016334
oct1357232101
9451531275
10196949057
11a1199818
1255b5b195
1331a59706
141c22a61b
1512455422
hexbbd3441

196949057 has 2 divisors, whose sum is σ = 196949058. Its totient is φ = 196949056.

The previous prime is 196949047. The next prime is 196949119. The reversal of 196949057 is 750949691.

196949057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 131079601 + 65869456 = 11449^2 + 8116^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-196949057 is a prime.

It is a Chen prime.

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

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

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

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

Almost surely, 2196949057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 612360, while the sum is 50.

The square root of 196949057 is about 14033.8539610472. The cubic root of 196949057 is about 581.8146268626.

The spelling of 196949057 in words is "one hundred ninety-six million, nine hundred forty-nine thousand, fifty-seven".