Search a number
-
+
11031011031 = 310136779901
BaseRepresentation
bin10100100010111111…
…11101111011010111
31001110202210102101010
422101133331323113
5140042414323111
65022332503303
7540234022005
oct122137757327
931422712333
1011031011031
114750799947
12217a31ab33
13106a494881
14769063a75
15448667aa6
hex2917fded7

11031011031 has 16 divisors (see below), whose sum is σ = 14859178848. Its totient is φ = 7278480000.

The previous prime is 11031011023. The next prime is 11031011041. The reversal of 11031011031 is 13011013011.

It is not a de Polignac number, because 11031011031 - 23 = 11031011023 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11031011041) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1109181 + ... + 1119081.

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

Almost surely, 211031011031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 13682.

The product of its (nonzero) digits is 9, while the sum is 12.

Adding to 11031011031 its reverse (13011013011), we get a palindrome (24042024042).

The spelling of 11031011031 in words is "eleven billion, thirty-one million, eleven thousand, thirty-one".

Divisors: 1 3 101 303 3677 9901 11031 29703 371377 1000001 1114131 3000003 36405977 109217931 3677003677 11031011031