Search a number
-
+
11020110505 = 510121822001
BaseRepresentation
bin10100100001101100…
…11000101010101001
31001110000021121122221
422100312120222221
5140032122014010
65021303114041
7540042252025
oct122066305251
931400247587
1011020110505
114745624148
122176742921
131068149161
14767827385
15447712dda
hex290d98aa9

11020110505 has 8 divisors (see below), whose sum is σ = 13355065224. Its totient is φ = 8728800000.

The previous prime is 11020110469. The next prime is 11020110527. The reversal of 11020110505 is 50501102011.

It can be written as a sum of positive squares in 4 ways, for example, as 1404150784 + 9615959721 = 37472^2 + 98061^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 11020110505 - 29 = 11020109993 is a prime.

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

It is a Duffinian number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10910496 + ... + 10911505.

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

Almost surely, 211020110505 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 21822107.

The product of its (nonzero) digits is 50, while the sum is 16.

Adding to 11020110505 its reverse (50501102011), we get a palindrome (61521212516).

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

Divisors: 1 5 101 505 21822001 109110005 2204022101 11020110505