Search a number
-
+
150342576898001 is a prime number
BaseRepresentation
bin100010001011110001011011…
…111000111111111111010001
3201201022121110200100100011212
4202023301123320333333101
5124201203044141214001
61251430232031545505
743444615131302015
oct4213613370777721
9651277420310155
10150342576898001
11439a3a24266174
1214a4149498b295
1365b7323591997
14291a896076545
15125ab4e9407bb
hex88bc5be3ffd1

150342576898001 has 2 divisors, whose sum is σ = 150342576898002. Its totient is φ = 150342576898000.

The previous prime is 150342576897977. The next prime is 150342576898061. The reversal of 150342576898001 is 100898675243051.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 119676510984976 + 30666065913025 = 10939676^2 + 5537695^2 .

It is a cyclic number.

It is not a de Polignac number, because 150342576898001 - 218 = 150342576635857 is a prime.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅150342576898001 = 300685153796002 is not.

Almost surely, 2150342576898001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14515200, while the sum is 59.

The spelling of 150342576898001 in words is "one hundred fifty trillion, three hundred forty-two billion, five hundred seventy-six million, eight hundred ninety-eight thousand, one".