Search a number
-
+
11001001010 = 253972771033
BaseRepresentation
bin10100011111011010…
…11111010000110010
31001101200022202100212
422033231133100302
5140012224013020
65015341344122
7536420652146
oct121755372062
931350282325
1011001001010
11473586197a
122170268042
1310641b816c
14765091226
15445bdacc5
hex28fb5f432

11001001010 has 16 divisors (see below), whose sum is σ = 19851687576. Its totient is φ = 4389314688.

The previous prime is 11001001003. The next prime is 11001001043. The reversal of 11001001010 is 1010010011.

It can be written as a sum of positive squares in 4 ways, for example, as 10578739609 + 422261401 = 102853^2 + 20549^2 .

It is a Harshad number since it is a multiple of its sum of digits (5).

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

It is an unprimeable number.

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, 1381547 + ... + 1389486.

Almost surely, 211001001010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 2771437.

The product of its (nonzero) digits is 1, while the sum is 5.

Adding to 11001001010 its reverse (1010010011), we get a palindrome (12011011021).

Subtracting from 11001001010 its reverse (1010010011), we obtain a palindrome (9990990999).

The spelling of 11001001010 in words is "eleven billion, one million, one thousand, ten".

Divisors: 1 2 5 10 397 794 1985 3970 2771033 5542066 13855165 27710330 1100100101 2200200202 5500500505 11001001010