Search a number
-
+
20011211011 = 1129269233201
BaseRepresentation
bin10010101000110000…
…101101100100000011
31220122121121211212101
4102220300231210003
5311440332223021
613105405411231
71305616326031
oct225060554403
956577554771
1020011211011
118539897020
123a65869b17
131b6bb0177c
14d7b9a3551
157c1c32a91
hex4a8c2d903

20011211011 has 16 divisors (see below), whose sum is σ = 22667234400. Its totient is φ = 17499328000.

The previous prime is 20011210993. The next prime is 20011211021. The reversal of 20011211011 is 11011211002.

It is a de Polignac number, because none of the positive numbers 2k-20011211011 is a prime.

It is a super-2 number, since 2×200112110112 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

Almost surely, 220011211011 is an apocalyptic number.

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

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

20011211011 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 233510.

The product of its (nonzero) digits is 4, while the sum is 10.

Adding to 20011211011 its reverse (11011211002), we get a palindrome (31022422013).

Subtracting from 20011211011 its reverse (11011211002), we obtain a palindrome (9000000009).

It can be divided in two parts, 200 and 11211011, that added together give a palindrome (11211211).

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

Divisors: 1 11 29 269 319 2959 7801 85811 233201 2565211 6762829 62731069 74391119 690041759 1819201001 20011211011