Search a number
-
+
2000110000000 = 2757728573
BaseRepresentation
bin11101000110101111110…
…110001001011110000000
321002012122002211102121011
4131012233312021132000
5230232211130000000
64130500550410304
7264334406326540
oct35065766113600
97065562742534
102000110000000
11701272a52482
12283774960994
131167c0299728
146cb3d325320
15370629aa2ba
hex1d1afd89780

2000110000000 has 256 divisors, whose sum is σ = 5692461989760. Its totient is φ = 685728000000.

The previous prime is 2000109999941. The next prime is 2000110000001. The reversal of 2000110000000 is 110002.

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

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 69985714 + ... + 70014286.

Almost surely, 22000110000000 is an apocalyptic number.

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

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

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

2000110000000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 2000110000000 its reverse (110002), we get a palindrome (2000110110002).

The spelling of 2000110000000 in words is "two trillion, one hundred ten million", and thus it is an aban number.