Search a number
-
+
200211011102 = 2100105505551
BaseRepresentation
bin1011101001110110000…
…0011001011000011110
3201010210001100011022102
42322131200121120132
511240013004323402
6231550424445102
720315262341504
oct2723540313036
9633701304272
10200211011102
11779aa994a43
1232976319792
1315b58c6030b
14999412c674
15531bc56102
hex2e9d81961e

200211011102 has 4 divisors (see below), whose sum is σ = 300316516656. Its totient is φ = 100105505550.

The previous prime is 200211011071. The next prime is 200211011107. The reversal of 200211011102 is 201110112002.

200211011102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a congruent number.

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

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

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

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

Almost surely, 2200211011102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100105505553.

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

Adding to 200211011102 its reverse (201110112002), we get a palindrome (401321123104).

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

Divisors: 1 2 100105505551 200211011102