Search a number
-
+
11001220010 = 2511100011091
BaseRepresentation
bin10100011111011100…
…10100101110101010
31001101200201212202222
422033232110232222
5140012303020020
65015350154042
7536422553504
oct121756245652
931350655688
1011001220010
1147359a1470
122170352922
131064263a51
1476510ad74
15445c30b25
hex28fb94baa

11001220010 has 16 divisors (see below), whose sum is σ = 21602395872. Its totient is φ = 4000443600.

The previous prime is 11001220007. The next prime is 11001220019. The reversal of 11001220010 is 1002210011.

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

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

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

Almost surely, 211001220010 is an apocalyptic number.

11001220010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 100011109.

The product of its (nonzero) digits is 4, while the sum is 8.

Adding to 11001220010 its reverse (1002210011), we get a palindrome (12003430021).

Subtracting from 11001220010 its reverse (1002210011), we obtain a palindrome (9999009999).

The spelling of 11001220010 in words is "eleven billion, one million, two hundred twenty thousand, ten".

Divisors: 1 2 5 10 11 22 55 110 100011091 200022182 500055455 1000110910 1100122001 2200244002 5500610005 11001220010