Search a number
-
+
20110211210 = 252011021121
BaseRepresentation
bin10010101110101010…
…010111100010001010
31220220111220120121102
4102232222113202022
5312141203224320
613123303341402
71311230655245
oct225652274212
956814816542
1020110211210
11858a765371
123a92a51862
131b8648517b
14d8abb425c
157ca78b175
hex4aea9788a

20110211210 has 8 divisors (see below), whose sum is σ = 36198380196. Its totient is φ = 8044084480.

The previous prime is 20110211197. The next prime is 20110211239. The reversal of 20110211210 is 1211201102.

It can be written as a sum of positive squares in 2 ways, for example, as 17726525881 + 2383685329 = 133141^2 + 48823^2 .

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

It is a Curzon number.

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

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 1005510551 + ... + 1005510570.

Almost surely, 220110211210 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2011021128.

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

Adding to 20110211210 its reverse (1211201102), we get a palindrome (21321412312).

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

Divisors: 1 2 5 10 2011021121 4022042242 10055105605 20110211210