Search a number
-
+
30274492625149 is a prime number
BaseRepresentation
bin1101110001000110101000…
…11000001111000011111101
310222012012202102222212222011
412320203110120033003331
512432004130103001044
6144215524312451221
76243155102246323
oct670432430170375
9128165672885864
1030274492625149
119712381918073
12348b4963a9b11
1313b7b45899836
147694169cdd13
15377797e92134
hex1b88d460f0fd

30274492625149 has 2 divisors, whose sum is σ = 30274492625150. Its totient is φ = 30274492625148.

The previous prime is 30274492625123. The next prime is 30274492625213. The reversal of 30274492625149 is 94152629447203.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 30263674545049 + 10818080100 = 5501243^2 + 104010^2 .

It is a cyclic number.

It is not a de Polignac number, because 30274492625149 - 213 = 30274492616957 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 30274492625093 and 30274492625102.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 230274492625149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 26127360, while the sum is 58.

The spelling of 30274492625149 in words is "thirty trillion, two hundred seventy-four billion, four hundred ninety-two million, six hundred twenty-five thousand, one hundred forty-nine".