Search a number
-
+
21110011021 = 1121091159911
BaseRepresentation
bin10011101010010000…
…010011010010001101
32000111012012200010001
4103222100103102031
5321213130323041
613410420444301
71345061063431
oct235220232215
960435180101
1021110011021
118a53061800
124111849691
131cb56521a8
1410438ac9c1
1583842d131
hex4ea41348d

21110011021 has 12 divisors (see below), whose sum is σ = 23224979232. Its totient is φ = 19173209000.

The previous prime is 21110010983. The next prime is 21110011049. The reversal of 21110011021 is 12011001112.

It is not a de Polignac number, because 21110011021 - 27 = 21110010893 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52056 + ... + 211966.

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

Almost surely, 221110011021 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 21110011021 its reverse (12011001112), we get a palindrome (33121012133).

Subtracting from 21110011021 its reverse (12011001112), we obtain a palindrome (9099009909).

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

Divisors: 1 11 121 1091 12001 132011 159911 1759021 19349231 174462901 1919091911 21110011021