Search a number
-
+
150455230111 is a prime number
BaseRepresentation
bin1000110000011111010…
…1001001111010011111
3112101100111001121012001
42030013311021322133
54431113014330421
6153041305423131
713604264232514
oct2140765117237
9471314047161
10150455230111
115889806728a
12251ab19aaa7
131125998a8a4
1473d401130b
153da8a52691
hex2307d49e9f

150455230111 has 2 divisors, whose sum is σ = 150455230112. Its totient is φ = 150455230110.

The previous prime is 150455230073. The next prime is 150455230139. The reversal of 150455230111 is 111032554051.

It is an a-pointer prime, because the next prime (150455230139) can be obtained adding 150455230111 to its sum of digits (28).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 150455230111 - 27 = 150455229983 is a prime.

It is a super-2 number, since 2×1504552301112 (a number of 23 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

Almost surely, 2150455230111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3000, while the sum is 28.

Adding to 150455230111 its reverse (111032554051), we get a palindrome (261487784162).

The spelling of 150455230111 in words is "one hundred fifty billion, four hundred fifty-five million, two hundred thirty thousand, one hundred eleven".