Search a number
-
+
30615071309 is a prime number
BaseRepresentation
bin11100100000110011…
…001110101001001101
32221000121122202120222
4130200303032221031
51000144424240214
622021523121125
72132445545444
oct344063165115
987017582528
1030615071309
1111a90456229
125b24b131a5
132b6b939914
1416a5dd5d5b
15be2b2238e
hex720ccea4d

30615071309 has 2 divisors, whose sum is σ = 30615071310. Its totient is φ = 30615071308.

The previous prime is 30615071303. The next prime is 30615071351. The reversal of 30615071309 is 90317051603.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 25264148809 + 5350922500 = 158947^2 + 73150^2 .

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

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 230615071309 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17010, while the sum is 35.

The spelling of 30615071309 in words is "thirty billion, six hundred fifteen million, seventy-one thousand, three hundred nine".