Search a number
-
+
20032011021 = 3113111951867
BaseRepresentation
bin10010101010000000…
…000011101100001101
31220201001202121010010
4102222000003230031
5312011143323041
613111431303433
71306261166331
oct225200035415
956631677103
1020032011021
11854a603410
123a7081ab79
131b73205079
14d806597c1
157c3990a16
hex4aa003b0d

20032011021 has 16 divisors (see below), whose sum is σ = 29231175168. Its totient is φ = 12101569200.

The previous prime is 20032011017. The next prime is 20032011079. The reversal of 20032011021 is 12011023002.

It is not a de Polignac number, because 20032011021 - 22 = 20032011017 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 220032011021 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1952192.

The product of its (nonzero) digits is 24, while the sum is 12.

Adding to 20032011021 its reverse (12011023002), we get a palindrome (32043034023).

The spelling of 20032011021 in words is "twenty billion, thirty-two million, eleven thousand, twenty-one".

Divisors: 1 3 11 33 311 933 3421 10263 1951867 5855601 21470537 64411611 607030637 1821091911 6677337007 20032011021