Search a number
-
+
150036726001 is a prime number
BaseRepresentation
bin1000101110111011100…
…0101100000011110001
3112100021022120101110211
42023232320230003301
54424233400213001
6152531555424121
713561023062101
oct2135670540361
9470238511424
10150036726001
11586a2902a18
12250b2bb5041
13111c106aa16
1473945d1201
153d81e36351
hex22eee2c0f1

150036726001 has 2 divisors, whose sum is σ = 150036726002. Its totient is φ = 150036726000.

The previous prime is 150036725963. The next prime is 150036726043. The reversal of 150036726001 is 100627630051.

150036726001 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., 148255801600 + 1780924401 = 385040^2 + 42201^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-150036726001 is a prime.

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

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

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

Almost surely, 2150036726001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7560, while the sum is 31.

The spelling of 150036726001 in words is "one hundred fifty billion, thirty-six million, seven hundred twenty-six thousand, one".