102001102000 has 160 divisors (see below), whose sum is σ = 283437108864. Its totient is φ = 34777728000.

The previous prime is 102001101997. The next prime is 102001102031. The reversal of 102001102000 is 201100201.

102001102000 is digitally balanced in base 3, 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 (7).

It is an unprimeable number.

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

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

Almost surely, 2^102001102000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 102001102000 its reverse (201100201), we get a palindrome (102202202201).

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