Search a number
-
+
156156710081 is a prime number
BaseRepresentation
bin1001000101101110101…
…0100100110011000001
3112221001211101210100212
42101123222210303001
510024302104210311
6155423140123505
714165465064221
oct2213352446301
9487054353325
10156156710081
11602534345a9
1226320696595
1311957c56388
1477b5314081
1540de36ec8b
hex245baa4cc1

156156710081 has 2 divisors, whose sum is σ = 156156710082. Its totient is φ = 156156710080.

The previous prime is 156156710057. The next prime is 156156710183. The reversal of 156156710081 is 180017651651.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 87935971600 + 68220738481 = 296540^2 + 261191^2 .

It is a cyclic number.

It is not a de Polignac number, because 156156710081 - 222 = 156152515777 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2156156710081 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 50400, while the sum is 41.

The spelling of 156156710081 in words is "one hundred fifty-six billion, one hundred fifty-six million, seven hundred ten thousand, eighty-one".