Search a number
BaseRepresentation
bin1010000000010010001111…
…0000010000111101101010
31102221120221200112121122220
42200010203300100331222
52420211010320200020
635221200233254510
72213503346424012
oct240044360207552
942846850477586
1011000011100010
113561095550579
121297a61564436
1361a3b180c4ca
142a0590c24c42
1514120764d240
hexa0123c10f6a

11000011100010 has 32 divisors (see below), whose sum is σ = 26607900874752. Its totient is φ = 2910239156160.

The previous prime is 11000011099999. The next prime is 11000011100083. The reversal of 11000011100010 is 1000111000011.

Adding to 11000011100010 its reverse (1000111000011), we get a palindrome (12000122100021).

Subtracting from 11000011100010 its reverse (1000111000011), we obtain a palindrome (9999900099999).

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

It is a Curzon number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 1443567201 + ... + 1443574820.

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

Almost surely, 211000011100010 is an apocalyptic number.

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

11000011100010 is an abundant number, since it is smaller than the sum of its proper divisors (15607889774742).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 2887142158.

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

The spelling of 11000011100010 in words is "eleven trillion, eleven million, one hundred thousand, ten".