Search a number
-
+
11010011010000 = 243541013679901
BaseRepresentation
bin1010000000110111011111…
…0010111001001111010000
31102222112202121010200022120
42200031313302321033100
52420342000304310000
635225532414134240
72214306223312362
oct240156762711720
942875677120276
1011010011010000
1135653572039a2
1212999924b1380
1361b316497a02
142a0c5cd62d32
151415e04de6a0
hexa0377cb93d0

11010011010000 has 400 divisors, whose sum is σ = 35995120474368. Its totient is φ = 2898720000000.

The previous prime is 11010011009993. The next prime is 11010011010017. The reversal of 11010011010000 is 1011001011.

11010011010000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a tau number, because it is divible by the number of its divisors (400).

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 1112005050 + ... + 1112014950.

Almost surely, 211010011010000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 11010011010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17997560237184).

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

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

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

11010011010000 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 11010011010000 its reverse (1011001011), we get a palindrome (11011022011011).

It can be divided in two parts, 110100 and 11010000, that multiplied together give a square (1212201000000 = 11010002).

The spelling of 11010011010000 in words is "eleven trillion, ten billion, eleven million, ten thousand".