Search a number
-
+
110200221112010 = 2571155211579031
BaseRepresentation
bin11001000011100111111101…
…000010001001011011001010
3112110012001000212220010021012
4121003213331002021123022
5103421010023101041020
61030213141021043522
732132463132061151
oct3103477502113312
9473161025803235
10110200221112010
11321277189a4097
121043965b0b65a2
134964ab435a233
141d2da0d53c598
15cb18622b17c5
hex6439fd0896ca

110200221112010 has 16 divisors (see below), whose sum is σ = 201154206425472. Its totient is φ = 43459242128400.

The previous prime is 110200221111919. The next prime is 110200221112049. The reversal of 110200221112010 is 10211122002011.

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

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

Almost surely, 2110200221112010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 155211579109.

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

Adding to 110200221112010 its reverse (10211122002011), we get a palindrome (120411343114021).

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

Divisors: 1 2 5 10 71 142 355 710 155211579031 310423158062 776057895155 1552115790310 11020022111201 22040044222402 55100110556005 110200221112010