Search a number
-
+
110010200200 = 2352550051001
BaseRepresentation
bin110011001110100011…
…1100111000010001000
3101111221210121012102021
41212131013213002020
53300300102401300
6122312112214224
710643104162435
oct1463507470210
9344853535367
10110010200200
114272298772a
12193a223a374
13a4b265b924
1454786bab8c
152cdce5ed1a
hex199d1e7088

110010200200 has 24 divisors (see below), whose sum is σ = 255773715930. Its totient is φ = 44004080000.

The previous prime is 110010200143. The next prime is 110010200213. The reversal of 110010200200 is 2002010011.

It can be written as a sum of positive squares in 3 ways, for example, as 100662791076 + 9347409124 = 317274^2 + 96682^2 .

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

Almost surely, 2110010200200 is an apocalyptic number.

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

It is an amenable number.

110010200200 is an abundant number, since it is smaller than the sum of its proper divisors (145763515730).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 550051017 (or 550051008 counting only the distinct ones).

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

Adding to 110010200200 its reverse (2002010011), we get a palindrome (112012210211).

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

Divisors: 1 2 4 5 8 10 20 25 40 50 100 200 550051001 1100102002 2200204004 2750255005 4400408008 5500510010 11001020020 13751275025 22002040040 27502550050 55005100100 110010200200