Search a number
-
+
11010110100000 = 25355113679091
BaseRepresentation
bin1010000000110111110110…
…1100111001001000100000
31102222120000111120222020120
42200031331230321020200
52420342201141200000
635225550314040240
72214311535464454
oct240157554711040
942876014528216
1011010110100000
1135653a8133760
1212999bb719080
1361b330b8024b
142a0c6c198664
151415e90646a0
hexa037db39220

11010110100000 has 576 divisors, whose sum is σ = 39520394532864. Its totient is φ = 2661552000000.

The previous prime is 11010110099977. The next prime is 11010110100001. The reversal of 11010110100000 is 101101011.

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 not an unprimeable number, because it can be changed into a prime (11010110100001) 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 95 ways as a sum of consecutive naturals, for example, 1211095455 + ... + 1211104545.

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

Almost surely, 211010110100000 is an apocalyptic number.

11010110100000 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 11010110100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19760197266432).

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

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

11010110100000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 11010110100000 its reverse (101101011), we get a palindrome (11010211201011).

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

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