Search a number
-
+
30196168693 is a prime number
BaseRepresentation
bin11100000111110101…
…001111011111110101
32212221102102022020021
4130013311033133311
5443320204344233
621512200405141
72116201125145
oct340765173765
985842368207
1030196168693
1111895a4a519
125a287767b1
132b02c0a552
141666510925
15bbae77e2d
hex707d4f7f5

30196168693 has 2 divisors, whose sum is σ = 30196168694. Its totient is φ = 30196168692.

The previous prime is 30196168669. The next prime is 30196168727. The reversal of 30196168693 is 39686169103.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 27717921169 + 2478247524 = 166487^2 + 49782^2 .

It is a cyclic number.

It is not a de Polignac number, because 30196168693 - 29 = 30196168181 is a prime.

It is a super-2 number, since 2×301961686932 (a number of 22 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 30196168693.

It is a congruent number.

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

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

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

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

Almost surely, 230196168693 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1259712, while the sum is 52.

The spelling of 30196168693 in words is "thirty billion, one hundred ninety-six million, one hundred sixty-eight thousand, six hundred ninety-three".