Search a number
-
+
20032011213 = 37194047001
BaseRepresentation
bin10010101010000000…
…000011101111001101
31220201001202121101020
4102222000003233031
5312011143324323
613111431304353
71306261200024
oct225200035715
956631677336
1020032011213
11854a603575
123a7081b0b9
131b73205196
14d806598bb
157c3990ae3
hex4aa003bcd

20032011213 has 8 divisors (see below), whose sum is σ = 27085536576. Its totient is φ = 13166580000.

The previous prime is 20032011193. The next prime is 20032011283. The reversal of 20032011213 is 31211023002.

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

It is not a de Polignac number, because 20032011213 - 212 = 20032007117 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 220032011213 is an apocalyptic number.

It is an amenable number.

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

20032011213 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 94047075.

The product of its (nonzero) digits is 72, while the sum is 15.

Adding to 20032011213 its reverse (31211023002), we get a palindrome (51243034215).

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

Divisors: 1 3 71 213 94047001 282141003 6677337071 20032011213