Search a number
-
+
11501156129 is a prime number
BaseRepresentation
bin10101011011000010…
…11011011100100001
31002200112110021012112
422231201123130201
5142023243444004
65141125405105
7555003133301
oct125541333441
932615407175
1011501156129
114972114911
12228b869795
1311139c5a38
147b1687601
15474a84e6e
hex2ad85b721

11501156129 has 2 divisors, whose sum is σ = 11501156130. Its totient is φ = 11501156128.

The previous prime is 11501156113. The next prime is 11501156179. The reversal of 11501156129 is 92165110511.

It is a happy number.

11501156129 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., 8002197025 + 3498959104 = 89455^2 + 59152^2 .

It is a cyclic number.

It is not a de Polignac number, because 11501156129 - 24 = 11501156113 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11501156095 and 11501156104.

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

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

Almost surely, 211501156129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 32.

The spelling of 11501156129 in words is "eleven billion, five hundred one million, one hundred fifty-six thousand, one hundred twenty-nine".