Search a number
-
+
150105065029 is a prime number
BaseRepresentation
bin1000101111001011110…
…1011000011001000101
3112100110002011100222221
42023302331120121011
54424403344040104
6152542440252341
713562513000203
oct2136275303105
9470402140887
10150105065029
115872843a057
1225111a710b1
131120227750a
14739d700073
153d87e34c54
hex22f2f58645

150105065029 has 2 divisors, whose sum is σ = 150105065030. Its totient is φ = 150105065028.

The previous prime is 150105065023. The next prime is 150105065093. The reversal of 150105065029 is 920560501051.

150105065029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 80763956100 + 69341108929 = 284190^2 + 263327^2 .

It is a cyclic number.

It is not a de Polignac number, because 150105065029 - 215 = 150105032261 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2150105065029 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 150105065029 in words is "one hundred fifty billion, one hundred five million, sixty-five thousand, twenty-nine".