Search a number
-
+
139021111 is a prime number
BaseRepresentation
bin10000100100101…
…00101100110111
3100200121000010001
420102110230313
5241042133421
621443412131
73305442235
oct1022245467
9320530101
10139021111
1171523689
123a684047
1322a56918
141466b955
15c311691
hex8494b37

139021111 has 2 divisors, whose sum is σ = 139021112. Its totient is φ = 139021110.

The previous prime is 139021109. The next prime is 139021123. The reversal of 139021111 is 111120931.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 139021111 - 21 = 139021109 is a prime.

Together with 139021109, it forms a pair of twin primes.

It is a congruent number.

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

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

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

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

Almost surely, 2139021111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 19.

The square root of 139021111 is about 11790.7213943847. The cubic root of 139021111 is about 518.0363701400.

The spelling of 139021111 in words is "one hundred thirty-nine million, twenty-one thousand, one hundred eleven".