Search a number
-
+
2000110022 = 21000055011
BaseRepresentation
bin111011100110111…
…0100000111000110
312011101120010010222
41313031310013012
513044012010042
6530245144342
7100364440361
oct16715640706
95141503128
102000110022
11937012299
124799bb0b2
1325b4b5471
1414d8c70d8
15ba8d52d2
hex773741c6

2000110022 has 4 divisors (see below), whose sum is σ = 3000165036. Its totient is φ = 1000055010.

The previous prime is 2000110009. The next prime is 2000110033. The reversal of 2000110022 is 2200110002.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 2200110002 = 21100055001.

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

It is a congruent number.

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 as a sum of consecutive naturals, namely, 500027504 + ... + 500027507.

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

Almost surely, 22000110022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1000055013.

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

The square root of 2000110022 is about 44722.5896164343. The cubic root of 2000110022 is about 1259.9441526435.

Adding to 2000110022 its reverse (2200110002), we get a palindrome (4200220024).

The spelling of 2000110022 in words is "two billion, one hundred ten thousand, twenty-two".

Divisors: 1 2 1000055011 2000110022