Search a number
-
+
30130131113213 is a prime number
BaseRepresentation
bin1101101100111001101111…
…10000110001010011111101
310221200102010122100020121212
412312130313300301103331
512422123002031110323
6144025331404334205
76226554510531635
oct666346760612375
9127612118306555
1030130131113213
11966713158250a
123467507b44365
1313a734a52c161
147624400256c5
15373b493dab78
hex1b6737c314fd

30130131113213 has 2 divisors, whose sum is σ = 30130131113214. Its totient is φ = 30130131113212.

The previous prime is 30130131113197. The next prime is 30130131113231. The reversal of 30130131113213 is 31231113103103.

Together with next prime (30130131113231) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 29312240590084 + 817890523129 = 5414078^2 + 904373^2 .

It is a cyclic number.

It is not a de Polignac number, because 30130131113213 - 24 = 30130131113197 is a prime.

It is a congruent number.

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

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

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

Almost surely, 230130131113213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 23.

Adding to 30130131113213 its reverse (31231113103103), we get a palindrome (61361244216316).

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