Search a number
-
+
149011147270357 is a prime number
BaseRepresentation
bin100001111000011001011100…
…100000000010100011010101
3201112121022211001121101010121
4201320121130200002203111
5124012344312200122412
61244530435342151541
743246462066221001
oct4170313440024325
9645538731541117
10149011147270357
11435302aaa155a9
12148674378825b1
13651b8c9b7c348
1428b226c65b701
1512361c6648107
hex87865c8028d5

149011147270357 has 2 divisors, whose sum is σ = 149011147270358. Its totient is φ = 149011147270356.

The previous prime is 149011147270243. The next prime is 149011147270421. The reversal of 149011147270357 is 753072741110941.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 144910578970161 + 4100568300196 = 12037881^2 + 2024986^2 .

It is a cyclic number.

It is not a de Polignac number, because 149011147270357 - 211 = 149011147268309 is a prime.

It is a congruent number.

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

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

Almost surely, 2149011147270357 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1481760, while the sum is 52.

The spelling of 149011147270357 in words is "one hundred forty-nine trillion, eleven billion, one hundred forty-seven million, two hundred seventy thousand, three hundred fifty-seven".