Search a number
-
+
200211001020022 = 2100105500510011
BaseRepresentation
bin101101100001011101000001…
…100110001000111001110110
3222020212222120220021110111211
4231201131001212020321312
5202220224112230120042
61545451355241352034
760112524150353266
oct5541350146107166
9866788526243454
10200211001020022
1158880010649733
121a55629719861a
138793a7c7a1a55
14376239ab9d7a6
151822e33205017
hexb61741988e76

200211001020022 has 4 divisors (see below), whose sum is σ = 300316501530036. Its totient is φ = 100105500510010.

The previous prime is 200211001020011. The next prime is 200211001020073. The reversal of 200211001020022 is 220020100112002.

It is a happy number.

It is a semiprime because it is the product of two primes.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50052750255004 + ... + 50052750255007.

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

Almost surely, 2200211001020022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100105500510013.

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

Adding to 200211001020022 its reverse (220020100112002), we get a palindrome (420231101132024).

The spelling of 200211001020022 in words is "two hundred trillion, two hundred eleven billion, one million, twenty thousand, twenty-two".

Divisors: 1 2 100105500510011 200211001020022