Search a number
-
+
11011485131 = 19579551849
BaseRepresentation
bin10100100000101010…
…11110110111001011
31001102102001101212122
422100111132313023
5140022420011011
65020354201455
7536606036123
oct122025366713
931372041778
1011011485131
114740772839
12217388328b
13106641919a
1476661dc83
15446aac3db
hex29055edcb

11011485131 has 4 divisors (see below), whose sum is σ = 11591037000. Its totient is φ = 10431933264.

The previous prime is 11011485127. The next prime is 11011485151. The reversal of 11011485131 is 13158411011.

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 11011485131 - 22 = 11011485127 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 11011485131.

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

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

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

Almost surely, 211011485131 is an apocalyptic number.

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

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

11011485131 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 579551868.

The product of its (nonzero) digits is 480, while the sum is 26.

Adding to 11011485131 its reverse (13158411011), we get a palindrome (24169896142).

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

Divisors: 1 19 579551849 11011485131