Search a number
-
+
2010011110100 = 2252731011095323
BaseRepresentation
bin11101001111111101111…
…111111000101011010100
321010011012010111221021122
4131033331333320223110
5230413000321010400
64135215241503112
7265134643352000
oct35177577705324
97104163457248
102010011110100
11705493963aa4
122856787a1a98
1311770a641766
146d3dc2a5700
1537441d32685
hex1d3fdff8ad4

2010011110100 has 288 divisors, whose sum is σ = 5185022304000. Its totient is φ = 675936576000.

The previous prime is 2010011109973. The next prime is 2010011110157. The reversal of 2010011110100 is 10111100102.

It is a happy number.

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 22010011110100 is an apocalyptic number.

2010011110100 is a gapful number since it is divisible by the number (20) 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 2010011110100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2592511152000).

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 2010011110100 its reverse (10111100102), we get a palindrome (2020122210202).

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