Search a number
-
+
139200151 is a prime number
BaseRepresentation
bin10000100110000…
…00011010010111
3100200221002201011
420103000122113
5241113401101
621451313051
73310116226
oct1023003227
9320832634
10139200151
1171636152
123a74b787
1322aba26c
14146b6cbd
15c349751
hex84c0697

139200151 has 2 divisors, whose sum is σ = 139200152. Its totient is φ = 139200150.

The previous prime is 139200079. The next prime is 139200157. The reversal of 139200151 is 151002931.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 139200151 - 215 = 139167383 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2139200151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 270, while the sum is 22.

The square root of 139200151 is about 11798.3113622247. The cubic root of 139200151 is about 518.2586611850.

The spelling of 139200151 in words is "one hundred thirty-nine million, two hundred thousand, one hundred fifty-one".