Search a number
-
+
110201021111210 = 25102031108007391
BaseRepresentation
bin11001000011101000101100…
…101101111001101110101010
3112110012010002122020021212012
4121003220230231321232222
5103421013142401024320
61030213352235515522
732132522015002301
oct3103505455715652
9473163078207765
10110201021111210
1132127a99534357
1210439842bb8ba2
134964bb100c943
141d2da878a7438
15cb18ac6384c5
hex643a2cb79baa

110201021111210 has 16 divisors (see below), whose sum is σ = 198363783969792. Its totient is φ = 44079976006800.

The previous prime is 110201021111191. The next prime is 110201021111303. The reversal of 110201021111210 is 12111120102011.

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

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52983386 + ... + 55024005.

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

Almost surely, 2110201021111210 is an apocalyptic number.

110201021111210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

110201021111210 is a deficient number, since it is larger than the sum of its proper divisors (88162762858582).

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

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

The sum of its prime factors is 108109429.

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

Adding to 110201021111210 its reverse (12111120102011), we get a palindrome (122312141213221).

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

Divisors: 1 2 5 10 102031 204062 510155 1020310 108007391 216014782 540036955 1080073910 11020102111121 22040204222242 55100510555605 110201021111210