Search a number
-
+
30357955013 is a prime number
BaseRepresentation
bin11100010001011110…
…011010000111000101
32220100200211220100012
4130101132122013011
5444133114030023
621540220200005
72123204234321
oct342136320705
986320756305
1030357955013
1111969301a21
125a72999005
132b2a5a50b9
14167dbc6981
15bca284978
hex71179a1c5

30357955013 has 2 divisors, whose sum is σ = 30357955014. Its totient is φ = 30357955012.

The previous prime is 30357954989. The next prime is 30357955031. The reversal of 30357955013 is 31055975303.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 29860531204 + 497423809 = 172802^2 + 22303^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 30357955013 - 222 = 30353760709 is a prime.

It is a congruent number.

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

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

Almost surely, 230357955013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 30357955013 in words is "thirty billion, three hundred fifty-seven million, nine hundred fifty-five thousand, thirteen".