Search a number
-
+
2011110200010 = 23253710738314737
BaseRepresentation
bin11101010000111111100…
…000100101001011001010
321010021000201122111012100
4131100333200211023022
5230422223202400020
64135520303054230
7265204120434522
oct35207740451312
97107021574170
102011110200010
117059a830756a
122859248a1376
13117854264112
146d4a4248682
15374a8588a90
hex1d43f8252ca

2011110200010 has 192 divisors, whose sum is σ = 5434917875712. Its totient is φ = 515540256768.

The previous prime is 2011110200009. The next prime is 2011110200027. The reversal of 2011110200010 is 100020111102.

It is a happy number.

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

It is a junction number, because it is equal to n+sod(n) for n = 2011110199965 and 2011110200001.

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, 136459362 + ... + 136474098.

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

Almost surely, 22011110200010 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 2011110200010 its reverse (100020111102), we get a palindrome (2111130311112).

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