Search a number
-
+
20021111213 = 211432721929
BaseRepresentation
bin10010101001010110…
…011110100110101101
31220200022020211101112
4102221112132212231
5312000401024323
613110401521405
71306066431425
oct225126364655
956608224345
1020021111213
118544439204
123a69043265
131b70b89a8c
14d7d01d485
157c2a3b178
hex4a959e9ad

20021111213 has 8 divisors (see below), whose sum is σ = 20121564480. Its totient is φ = 19920710880.

The previous prime is 20021111161. The next prime is 20021111239. The reversal of 20021111213 is 31211112002.

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

It is a cyclic number.

It is not a de Polignac number, because 20021111213 - 28 = 20021110957 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 220021111213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 26467.

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

Adding to 20021111213 its reverse (31211112002), we get a palindrome (51232223215).

The spelling of 20021111213 in words is "twenty billion, twenty-one million, one hundred eleven thousand, two hundred thirteen".

Divisors: 1 211 4327 21929 912997 4627019 94886783 20021111213