Search a number
-
+
110011220101 = 1013594636553
BaseRepresentation
bin110011001110100101…
…1100000000010000101
3101111221212112000110101
41212131023200002011
53300300333020401
6122312150124101
710643115641056
oct1463513400205
9344855460411
10110011220101
1142723513a22
12193a2650631
13a4b2927c13
1454788a472d
152cdd0b2101
hex199d2e0085

110011220101 has 16 divisors (see below), whose sum is σ = 111667576320. Its totient is φ = 108367459200.

The previous prime is 110011220071. The next prime is 110011220119. The reversal of 110011220101 is 101022110011.

It is a cyclic number.

It is not a de Polignac number, because 110011220101 - 27 = 110011219973 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16784641 + ... + 16791193.

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

Almost surely, 2110011220101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 7476.

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

Adding to 110011220101 its reverse (101022110011), we get a palindrome (211033330112).

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

Divisors: 1 101 359 463 6553 36259 46763 166217 661853 2352527 3034039 16787917 237605227 306437939 1089220001 110011220101