Search a number
110220021 = 343314111
BaseRepresentation
bin1101001000111…
…01001011110101
321200101202110000
412210131023311
5211204020041
614534221513
72505566112
oct644351365
9250352400
10110220021
1157241a2a
1230ab4899
1319ab1562
14108d1909
159a22bb6
hex691d2f5

110220021 has 20 divisors (see below), whose sum is σ = 165187264. Its totient is φ = 73240200.

The previous prime is 110220017. The next prime is 110220023. The reversal of 110220021 is 120022011.

It is not a de Polignac number, because 110220021 - 22 = 110220017 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110220023) by changing a digit.

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 24756 + ... + 28866.

Almost surely, 2110220021 is an apocalyptic number.

It is an amenable number.

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

110220021 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

The square root of 110220021 is about 10498.5723315125. The cubic root of 110220021 is about 479.4612314313.

Adding to 110220021 its reverse (120022011), we get a palindrome (230242032).

The spelling of 110220021 in words is "one hundred ten million, two hundred twenty thousand, twenty-one".