Search a number
-
+
11031531131 = 91921120011
BaseRepresentation
bin10100100011000011…
…11100111001111011
31001110210202211211002
422101201330321323
5140043032444011
65022351555215
7540241316225
oct122141747173
931423684732
1011031531131
114751014685
12217a52bb0b
13106a61751a
1476915b415
1544871bc3b
hex29187ce7b

11031531131 has 4 divisors (see below), whose sum is σ = 11031743064. Its totient is φ = 11031319200.

The previous prime is 11031531113. The next prime is 11031531143. The reversal of 11031531131 is 13113513011.

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 11031531131 - 226 = 10964422267 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31916 + ... + 151926.

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

Almost surely, 211031531131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 211932.

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

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

Divisors: 1 91921 120011 11031531131