Search a number
-
+
11150505031 is a prime number
BaseRepresentation
bin10100110001001111…
…10011010001000111
31001210002122100022211
422120213303101013
5140314012130111
65042242004251
7543214505011
oct123047632107
931702570284
1011150505031
114802195516
1221b2346687
131089172393
1477ac8b1b1
15453dbd521
hex2989f3447

11150505031 has 2 divisors, whose sum is σ = 11150505032. Its totient is φ = 11150505030.

The previous prime is 11150505019. The next prime is 11150505059. The reversal of 11150505031 is 13050505111.

11150505031 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 is a cyclic number.

It is not a de Polignac number, because 11150505031 - 223 = 11142116423 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 211150505031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 375, while the sum is 22.

The spelling of 11150505031 in words is "eleven billion, one hundred fifty million, five hundred five thousand, thirty-one".