Search a number
-
+
110112200210 = 2511819323641
BaseRepresentation
bin110011010001100110…
…0101101011000010010
3101112012220112100010102
41212203030231120102
53301002210401320
6122330154332402
710645453154525
oct1464314553022
9345186470112
10110112200210
1142775514861
121941042a102
13a4ca82286c
14548806cbbc
152ce6dac175
hex19a332d612

110112200210 has 16 divisors (see below), whose sum is σ = 198369807192. Its totient is φ = 44007580800.

The previous prime is 110112200203. The next prime is 110112200299. The reversal of 110112200210 is 12002211011.

It can be written as a sum of positive squares in 4 ways, for example, as 104968872121 + 5143328089 = 323989^2 + 71717^2 .

It is a junction number, because it is equal to n+sod(n) for n = 110112200191 and 110112200200.

It is an unprimeable number.

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

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

Almost surely, 2110112200210 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 9324829.

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

Adding to 110112200210 its reverse (12002211011), we get a palindrome (122114411221).

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

Divisors: 1 2 5 10 1181 2362 5905 11810 9323641 18647282 46618205 93236410 11011220021 22022440042 55056100105 110112200210