Search a number
-
+
10200200110 = 258911460899
BaseRepresentation
bin10010111111111101…
…01011001110101110
3222022212110212001021
421133332223032232
5131342222400420
64404053404354
7510525161512
oct113776531656
928285425037
1010200200110
114364824351
121b880396ba
13c67314889
146ca998142
153ea7567aa
hex25ffab3ae

10200200110 has 16 divisors (see below), whose sum is σ = 18566658000. Its totient is φ = 4034236096.

The previous prime is 10200200093. The next prime is 10200200123. The reversal of 10200200110 is 1100200201.

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

It is a congruent number.

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, 5729560 + ... + 5731339.

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

Almost surely, 210200200110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 11460995.

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

Adding to 10200200110 its reverse (1100200201), we get a palindrome (11300400311).

Subtracting from 10200200110 its reverse (1100200201), we obtain a palindrome (9099999909).

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

Divisors: 1 2 5 10 89 178 445 890 11460899 22921798 57304495 114608990 1020020011 2040040022 5100100055 10200200110