Search a number
-
+
110201120102000 = 245331257919901
BaseRepresentation
bin11001000011101000110010…
…100111100001011001110000
3112110012010100112111112200202
4121003220302213201121300
5103421013343221231000
61030213410133334332
732132524326262214
oct3103506247413160
9473163315445622
10110201120102000
113212803a3a6624
12104398701973a8
134964bc868bc85
141d2da96ab4944
15cb18b618ddd5
hex643a329e1670

110201120102000 has 240 divisors, whose sum is σ = 275414636120832. Its totient is φ = 42646824000000.

The previous prime is 110201120101957. The next prime is 110201120102069. The reversal of 110201120102000 is 201021102011.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11130297050 + ... + 11130306950.

Almost surely, 2110201120102000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110201120102000 its reverse (201021102011), we get a palindrome (110402141204011).

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