Search a number
-
+
1139068141 is a prime number
BaseRepresentation
bin100001111100100…
…1100110011101101
32221101100122201221
41003321030303231
54313100140031
6305010103341
740140630241
oct10371146355
92841318657
101139068141
11534a79832
1227957ab51
13151cac323
14ab3cc421
156a001a11
hex43e4cced

1139068141 has 2 divisors, whose sum is σ = 1139068142. Its totient is φ = 1139068140.

The previous prime is 1139068093. The next prime is 1139068159. The reversal of 1139068141 is 1418609311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1138792516 + 275625 = 33746^2 + 525^2 .

It is a cyclic number.

It is not a de Polignac number, because 1139068141 - 213 = 1139059949 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21139068141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184, while the sum is 34.

The square root of 1139068141 is about 33750.0835702669. The cubic root of 1139068141 is about 1044.3592115569.

The spelling of 1139068141 in words is "one billion, one hundred thirty-nine million, sixty-eight thousand, one hundred forty-one".