Search a number
-
+
11031530311 = 109871004053
BaseRepresentation
bin10100100011000011…
…11100101101000111
31001110210202210200201
422101201330231013
5140043032432221
65022351551331
7540241313644
oct122141745507
931423683621
1011031530311
114751013aaa
12217a52b547
13106a617039
1476915adcb
1544871b891
hex29187cb47

11031530311 has 4 divisors (see below), whose sum is σ = 11032545352. Its totient is φ = 11030515272.

The previous prime is 11031530297. The next prime is 11031530347. The reversal of 11031530311 is 11303513011.

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

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 11031530311 - 27 = 11031530183 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11031530351) 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 in 3 ways as a sum of consecutive naturals, for example, 491040 + ... + 513013.

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

Almost surely, 211031530311 is an apocalyptic number.

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

11031530311 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1015040.

The product of its (nonzero) digits is 135, while the sum is 19.

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

Divisors: 1 10987 1004053 11031530311