Search a number
-
+
200211010020110 = 25151132590072861
BaseRepresentation
bin101101100001011101000010…
…001000011110001100001110
3222020212222121112012201022102
4231201131002020132030032
5202220224122031120420
61545451400202315102
760112524320016515
oct5541350210361416
9866788545181272
10200211010020110
1158880015736621
121a55629a1b8a92
138793a8160344b
14376239c06367c
151822e33dd1a75
hexb6174221e30e

200211010020110 has 16 divisors (see below), whose sum is σ = 362766439350432. Its totient is φ = 79554043716000.

The previous prime is 200211010020059. The next prime is 200211010020113. The reversal of 200211010020110 is 11020010112002.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (200211010020113) 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, 66295034921 + ... + 66295037940.

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

Almost surely, 2200211010020110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 132590073019.

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

Adding to 200211010020110 its reverse (11020010112002), we get a palindrome (211231020132112).

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

Divisors: 1 2 5 10 151 302 755 1510 132590072861 265180145722 662950364305 1325900728610 20021101002011 40042202004022 100105505010055 200211010020110