Search a number
-
+
196973047 is a prime number
BaseRepresentation
bin10111011110110…
…01000111110111
3111201122021020001
423233121013313
5400411114142
631313452131
74611146305
oct1357310767
9451567201
10196973047
11a1205847
1255b71047
1331a675cb
141c235275
151245c5b7
hexbbd91f7

196973047 has 2 divisors, whose sum is σ = 196973048. Its totient is φ = 196973046.

The previous prime is 196973009. The next prime is 196973071. The reversal of 196973047 is 740379691.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 196973047 - 215 = 196940279 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2196973047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 285768, while the sum is 46.

The square root of 196973047 is about 14034.7086539051. The cubic root of 196973047 is about 581.8382491577.

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