Search a number
-
+
110201200112 = 2417405151471
BaseRepresentation
bin110011010100010000…
…0001101110111110000
3101112110010000000001002
41212220200031313300
53301143001400422
6122343054101132
710650613513463
oct1465040156760
9345403000032
10110201200112
11428107827a3
12194361aa7a8
13a5130b4523
145495bd92da
152ceeadc692
hex19a880ddf0

110201200112 has 20 divisors (see below), whose sum is σ = 226074521376. Its totient is φ = 51859388160.

The previous prime is 110201200063. The next prime is 110201200133. The reversal of 110201200112 is 211002102011.

It is a super-2 number, since 2×1102012001122 (a number of 23 digits) contains 22 as substring.

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

It is a congruent number.

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

Almost surely, 2110201200112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

Adding to 110201200112 its reverse (211002102011), we get a palindrome (321203302123).

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

Divisors: 1 2 4 8 16 17 34 68 136 272 405151471 810302942 1620605884 3241211768 6482423536 6887575007 13775150014 27550300028 55100600056 110201200112