1200010000 has 300 divisors, whose sum is σ = 3532869120. Its totient is φ = 393120000.

The previous prime is 1200009997. The next prime is 1200010001. The reversal of 1200010000 is 100021.

1200010000 = T₅₆ + T₅₇ + ... + T₁₉₃₀.

1200010000 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 15189961 + ... + 15190039.

Almost surely, 2^1200010000 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 1200010000 is about 34641.1604886441. The cubic root of 1200010000 is about 1062.6615210038.

Adding to 1200010000 its reverse (100021), we get a palindrome (1200110021).

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