Search a number
-
+
30920987113 is a prime number
BaseRepresentation
bin11100110011000010…
…001101000111101001
32221210221021220011221
4130303002031013221
51001311233041423
622112132022041
72143152024322
oct346302150751
987727256157
1030920987113
1112128100305
125bab461921
132bba1292a3
1416d48a9449
15c0e8ede5d
hex73308d1e9

30920987113 has 2 divisors, whose sum is σ = 30920987114. Its totient is φ = 30920987112.

The previous prime is 30920987051. The next prime is 30920987137. The reversal of 30920987113 is 31178902903.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 28551536784 + 2369450329 = 168972^2 + 48677^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×309209871132 (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 30920987113.

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

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

Almost surely, 230920987113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 81648, while the sum is 43.

The spelling of 30920987113 in words is "thirty billion, nine hundred twenty million, nine hundred eighty-seven thousand, one hundred thirteen".