Search a number
-
+
2011010200111 = 11414459002661
BaseRepresentation
bin11101010000111001100…
…011000111001000101111
321010020202202110222010101
4131100321203013020233
5230422022102400421
64135502331451531
7265201464442603
oct35207143071057
97106682428111
102011010200111
11705956916120
122858b72b6ba7
13117839620693
146d494c57503
153749e8d4191
hex1d4398c722f

2011010200111 has 8 divisors (see below), whose sum is σ = 2247337341648. Its totient is φ = 1783601064000.

The previous prime is 2011010200103. The next prime is 2011010200153. The reversal of 2011010200111 is 1110020101102.

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 2011010200111 - 23 = 2011010200103 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 (2011010204111) 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, 2229500880 + ... + 2229501781.

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

Almost surely, 22011010200111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4459002713.

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

Adding to 2011010200111 its reverse (1110020101102), we get a palindrome (3121030301213).

Subtracting from 2011010200111 its reverse (1110020101102), we obtain a palindrome (900990099009).

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

Divisors: 1 11 41 451 4459002661 49049029271 182819109101 2011010200111