Search a number
-
+
30113200213 is a prime number
BaseRepresentation
bin11100000010111000…
…101111100001010101
32212201122022001212121
4130002320233201111
5443132434401323
621500034215541
72114142656425
oct340270574125
985648261777
1030113200213
1111853131028
125a04a245b1
132abb97ac85
1416594b4485
15bb3a39a5d
hex702e2f855

30113200213 has 2 divisors, whose sum is σ = 30113200214. Its totient is φ = 30113200212.

The previous prime is 30113200207. The next prime is 30113200219. The reversal of 30113200213 is 31200231103.

It is a balanced prime because it is at equal distance from previous prime (30113200207) and next prime (30113200219).

It can be written as a sum of positive squares in only one way, i.e., 29625982884 + 487217329 = 172122^2 + 22073^2 .

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

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 230113200213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 16.

Adding to 30113200213 its reverse (31200231103), we get a palindrome (61313431316).

The spelling of 30113200213 in words is "thirty billion, one hundred thirteen million, two hundred thousand, two hundred thirteen".