Search a number
-
+
11010011022010 = 257211131327118409
BaseRepresentation
bin1010000000110111011111…
…0010111100001010111010
31102222112202121011021210101
42200031313302330022322
52420342000310201020
635225532414310014
72214306223362400
oct240156762741272
942875677137711
1011010011022010
113565357211a20
1212999924b830a
1361b3164a0310
142a0c5cd67470
151415e04e300a
hexa0377cbc2ba

11010011022010 has 192 divisors, whose sum is σ = 27104606000640. Its totient is φ = 3165301601280.

The previous prime is 11010011021981. The next prime is 11010011022097. The reversal of 11010011022010 is 1022011001011.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 92923686 + ... + 93042094.

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

Almost surely, 211010011022010 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 119781 (or 119774 counting only the distinct ones).

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

Adding to 11010011022010 its reverse (1022011001011), we get a palindrome (12032022023021).

The spelling of 11010011022010 in words is "eleven trillion, ten billion, eleven million, twenty-two thousand, ten".