Search a number
-
+
30131431069 is a prime number
BaseRepresentation
bin11100000011111110…
…010010011010011101
32212202220121021220111
4130003332102122131
5443202121243234
621501525050021
72114453636545
oct340376223235
985686537814
1030131431069
1111862453153
125a0ab56911
132ac269206c
14165ba9c325
15bb543b664
hex703f9269d

30131431069 has 2 divisors, whose sum is σ = 30131431070. Its totient is φ = 30131431068.

The previous prime is 30131430983. The next prime is 30131431081. The reversal of 30131431069 is 96013413103.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 29117327044 + 1014104025 = 170638^2 + 31845^2 .

It is a cyclic number.

It is not a de Polignac number, because 30131431069 - 27 = 30131430941 is a prime.

It is a super-4 number, since 4×301314310694 (a number of 43 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.

It is a self number, because there is not a number n which added to its sum of digits gives 30131431069.

It is a congruent number.

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

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

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

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

Almost surely, 230131431069 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 30131431069 in words is "thirty billion, one hundred thirty-one million, four hundred thirty-one thousand, sixty-nine".