Search a number
-
+
196930101713 is a prime number
BaseRepresentation
bin1011011101100111110…
…0101110000111010001
3200211022101201200201212
42313121330232013101
511211303101223323
6230245103305505
720141053150142
oct2673174560721
9624271650655
10196930101713
11765769aa184
12321bb5ab295
1315755303507
1497624c1ac9
1551c8bc4b78
hex2dd9f2e1d1

196930101713 has 2 divisors, whose sum is σ = 196930101714. Its totient is φ = 196930101712.

The previous prime is 196930101673. The next prime is 196930101769. The reversal of 196930101713 is 317101039691.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 183910607104 + 13019494609 = 428848^2 + 114103^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 196930101713 - 26 = 196930101649 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2196930101713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30618, while the sum is 41.

The spelling of 196930101713 in words is "one hundred ninety-six billion, nine hundred thirty million, one hundred one thousand, seven hundred thirteen".