Search a number
-
+
150537109981 is a prime number
BaseRepresentation
bin1000110000110010110…
…1100000000111011101
3112101120012010112020211
42030030231200013131
54431300000004411
6153053352412421
713606310215366
oct2141455400735
9471505115224
10150537109981
115892a3018a5
12252126a7111
131127092880b
147400c46b6d
153db0d28221
hex230cb601dd

150537109981 has 2 divisors, whose sum is σ = 150537109982. Its totient is φ = 150537109980.

The previous prime is 150537109973. The next prime is 150537110011. The reversal of 150537109981 is 189901735051.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 82306445881 + 68230664100 = 286891^2 + 261210^2 .

It is a cyclic number.

It is not a de Polignac number, because 150537109981 - 23 = 150537109973 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2150537109981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 340200, while the sum is 49.

The spelling of 150537109981 in words is "one hundred fifty billion, five hundred thirty-seven million, one hundred nine thousand, nine hundred eighty-one".