Search a number
-
+
20012010213 = 313513128467
BaseRepresentation
bin10010101000110011…
…110000101011100101
31220122200010110011110
4102220303300223211
5311441033311323
613105434455233
71305626165046
oct225063605345
956580113143
1020012010213
11853a292518
123a65b94519
131b6c021480
14d7bb308cd
157c1d3e793
hex4a8cf0ae5

20012010213 has 8 divisors (see below), whose sum is σ = 28735194208. Its totient is φ = 12315083184.

The previous prime is 20012010203. The next prime is 20012010253. The reversal of 20012010213 is 31201021002.

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

It is not a de Polignac number, because 20012010213 - 29 = 20012009701 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 (20012010203) by changing a digit.

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

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

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

Almost surely, 220012010213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 513128483.

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

Adding to 20012010213 its reverse (31201021002), we get a palindrome (51213031215).

The spelling of 20012010213 in words is "twenty billion, twelve million, ten thousand, two hundred thirteen".

Divisors: 1 3 13 39 513128467 1539385401 6670670071 20012010213