Search a number
-
+
11010001010000 = 245441197271503
BaseRepresentation
bin1010000000110111011100…
…1100101111110101010000
31102222112201220022121220012
42200031313030233311100
52420341440224310000
635225531415534052
72214306042313016
oct240156714576520
942875656277805
1011010001010000
1135653515a3833
12129998b08a328
1361b3143a6155
142a0c5b8bc8b6
151415de6b6735
hexa037732fd50

11010001010000 has 400 divisors, whose sum is σ = 27601116415488. Its totient is φ = 4250534400000.

The previous prime is 11010001009999. The next prime is 11010001010009. The reversal of 11010001010000 is 1010001011.

11010001010000 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 (5).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11010001010009) by changing a digit.

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

Almost surely, 211010001010000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11010001010000 its reverse (1010001011), we get a palindrome (11011011011011).

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