Search a number
-
+
30522139033 is a prime number
BaseRepresentation
bin11100011011010000…
…101110000110011001
32220210010210022110211
4130123100232012121
51000002131422113
622004403211121
72130236621041
oct343320560631
986703708424
1030522139033
1111a42a518a1
125ab9976aa1
132b555cc0c9
141697924721
15bd98b6b3d
hex71b42e199

30522139033 has 2 divisors, whose sum is σ = 30522139034. Its totient is φ = 30522139032.

The previous prime is 30522139013. The next prime is 30522139129. The reversal of 30522139033 is 33093122503.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 15913065609 + 14609073424 = 126147^2 + 120868^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×305221390332 (a number of 22 digits) contains 22 as substring.

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

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

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

Almost surely, 230522139033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14580, while the sum is 31.

The spelling of 30522139033 in words is "thirty billion, five hundred twenty-two million, one hundred thirty-nine thousand, thirty-three".