Search a number
-
+
20110200021 = 331345155373
BaseRepresentation
bin10010101110101010…
…010100110011010101
31220220111220000021000
4102232222110303111
5312141202400041
613123303213513
71311230610522
oct225652246325
956814800230
1020110200021
11858a757a1a
123a92a47299
131b86480052
14d8abb0149
157ca787bb6
hex4aea94cd5

20110200021 has 16 divisors (see below), whose sum is σ = 29795641920. Its totient is φ = 13405561200.

The previous prime is 20110200007. The next prime is 20110200023. The reversal of 20110200021 is 12000201102.

It is not a de Polignac number, because 20110200021 - 26 = 20110199957 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20110200023) 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, 335491 + ... + 390863.

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

Almost surely, 220110200021 is an apocalyptic number.

It is an amenable number.

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

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

20110200021 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 20110200021 its reverse (12000201102), we get a palindrome (32110401123).

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

Divisors: 1 3 9 27 13451 40353 55373 121059 166119 363177 498357 1495071 744822223 2234466669 6703400007 20110200021