Search a number
-
+
11540765221 = 104871100483
BaseRepresentation
bin10101011111110001…
…00001101000100101
31002210021222121122221
422233320201220211
5142113413441341
65145102352341
7555663612556
oct125770415045
932707877587
1011540765221
1149925087a7
1222a0b8b6b1
13111bc8367b
147b6a3832d
154782aaed1
hex2afe21a25

11540765221 has 4 divisors (see below), whose sum is σ = 11541876192. Its totient is φ = 11539654252.

The previous prime is 11540765213. The next prime is 11540765279. The reversal of 11540765221 is 12256704511.

11540765221 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, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 11540765221 - 23 = 11540765213 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11540765521) 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, 539755 + ... + 560728.

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

Almost surely, 211540765221 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1110970.

The product of its (nonzero) digits is 16800, while the sum is 34.

The spelling of 11540765221 in words is "eleven billion, five hundred forty million, seven hundred sixty-five thousand, two hundred twenty-one".

Divisors: 1 10487 1100483 11540765221