Search a number
-
+
102002011012000 = 25531123318094019
BaseRepresentation
bin10111001100010100110001…
…101000011111101110100000
3111101011022000112020101002201
4113030110301220133232200
5101332200104304341000
61000535024342422544
730325254631025131
oct2714246150375640
9441138015211081
10102002011012000
112a5568a0036050
12b53480b131a54
1344bb99620ba38
141b28cd07c5c88
15bbd48e0d796a
hex5cc531a1fba0

102002011012000 has 768 divisors, whose sum is σ = 294929820057600. Its totient is φ = 34283504640000.

The previous prime is 102002011011997. The next prime is 102002011012003. The reversal of 102002011012000 is 210110200201.

It is an interprime number because it is at equal distance from previous prime (102002011011997) and next prime (102002011012003).

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

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

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 127 ways as a sum of consecutive naturals, for example, 25379945991 + ... + 25379950009.

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

Almost surely, 2102002011012000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 102002011012000 its reverse (210110200201), we get a palindrome (102212121212201).

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