Search a number
-
+
110102011012000 = 255374325413931
BaseRepresentation
bin11001000010001100011111…
…010000010110001110100000
3112102211122112110021010012201
4121002030133100112032200
5103412402404304341000
61030100055433502544
732122415321023030
oct3102143720261640
9472748473233181
10110102011012000
113209a000954387
1210422610871a54
134958762612617
141d28d740c58c0
15cae01528796a
hex64231f4163a0

110102011012000 has 576 divisors, whose sum is σ = 317189311665408. Its totient is φ = 36793854720000.

The previous prime is 110102011011959. The next prime is 110102011012009. The reversal of 110102011012000 is 210110201011.

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 (110102011012009) by changing a digit.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 28008650035 + ... + 28008653965.

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

Almost surely, 2110102011012000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110102011012000 its reverse (210110201011), we get a palindrome (110312121213011).

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