Search a number
-
+
150350544361 is a prime number
BaseRepresentation
bin1000110000000110010…
…1110011110111101001
3112101002012002000100001
42030001211303313221
54430404214404421
6153023045543001
713601553353323
oct2140145636751
9471065060301
10150350544361
1158843a65336
1225180114a61
1311241096364
1473c4160613
153d9e774691
hex2301973de9

150350544361 has 2 divisors, whose sum is σ = 150350544362. Its totient is φ = 150350544360.

The previous prime is 150350544299. The next prime is 150350544389. The reversal of 150350544361 is 163445053051.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 83437788736 + 66912755625 = 288856^2 + 258675^2 .

It is a cyclic number.

It is not a de Polignac number, because 150350544361 - 27 = 150350544233 is a prime.

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

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

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

Almost surely, 2150350544361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108000, while the sum is 37.

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