Search a number
-
+
150865864433 is a prime number
BaseRepresentation
bin1000110010000001001…
…1100110011011110001
3112102102002201222120122
42030200103212123301
54432433130130213
6153150135020025
713620411455234
oct2144023463361
9472362658518
10150865864433
1158a88935999
12252a480a615
13112c3a8368b
14743278341b
153dceb16d08
hex23204e66f1

150865864433 has 2 divisors, whose sum is σ = 150865864434. Its totient is φ = 150865864432.

The previous prime is 150865864367. The next prime is 150865864439. The reversal of 150865864433 is 334468568051.

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., 110405346529 + 40460517904 = 332273^2 + 201148^2 .

It is an emirp because it is prime and its reverse (334468568051) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 150865864433 - 210 = 150865863409 is a prime.

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

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

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

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

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

Almost surely, 2150865864433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8294400, while the sum is 53.

The spelling of 150865864433 in words is "one hundred fifty billion, eight hundred sixty-five million, eight hundred sixty-four thousand, four hundred thirty-three".