Search a number
-
+
110201111210 = 2597113609393
BaseRepresentation
bin110011010100001111…
…1111000001010101010
3101112110002211111002102
41212220133320022222
53301142441024320
6122343052133402
710650612663341
oct1465037701252
9345402744072
10110201111210
1142810721a23
1219436167262
13a513082c18
145495bb4b58
152ceeac1175
hex19a87f82aa

110201111210 has 16 divisors (see below), whose sum is σ = 200406971016. Its totient is φ = 43626006528.

The previous prime is 110201111123. The next prime is 110201111233. The reversal of 110201111210 is 12111102011.

It can be written as a sum of positive squares in 4 ways, for example, as 51282772849 + 58918338361 = 226457^2 + 242731^2 .

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

It is an unprimeable number.

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

Almost surely, 2110201111210 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 113609497.

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

Adding to 110201111210 its reverse (12111102011), we get a palindrome (122312213221).

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

Divisors: 1 2 5 10 97 194 485 970 113609393 227218786 568046965 1136093930 11020111121 22040222242 55100555605 110201111210