Search a number
-
+
11503055149 is a prime number
BaseRepresentation
bin10101011011010001…
…01011000100101101
31002200200000202011121
422231220223010231
5142024240231044
65141234220541
7555025232635
oct125550530455
932620022147
1011503055149
1149731a1653
122290424751
13111420c211
147b1a1d6c5
15474d0c984
hex2ada2b12d

11503055149 has 2 divisors, whose sum is σ = 11503055150. Its totient is φ = 11503055148.

The previous prime is 11503055129. The next prime is 11503055153. The reversal of 11503055149 is 94155030511.

11503055149 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6296422500 + 5206632649 = 79350^2 + 72157^2 .

It is a cyclic number.

It is not a de Polignac number, because 11503055149 - 29 = 11503054637 is a prime.

It is a congruent number.

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

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

Almost surely, 211503055149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13500, while the sum is 34.

The spelling of 11503055149 in words is "eleven billion, five hundred three million, fifty-five thousand, one hundred forty-nine".