Search a number
-
+
200010111123 = 3376823264091
BaseRepresentation
bin1011101001000110001…
…0000001100010010011
3201010021001022101100110
42322101202001202103
511234110042023443
6231514450452403
720310302615334
oct2722142014223
9633231271313
10200010111123
11779075478a9
123291ab94103
1315b2644c4a4
14997559428b
1553092c0233
hex2e91881893

200010111123 has 16 divisors (see below), whose sum is σ = 273928898816. Its totient is φ = 129716782560.

The previous prime is 200010111121. The next prime is 200010111127. The reversal of 200010111123 is 321111010002.

It is not a de Polignac number, because 200010111123 - 21 = 200010111121 is a prime.

It is a super-2 number, since 2×2000101111232 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 625308 + ... + 889398.

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

Almost surely, 2200010111123 is an apocalyptic number.

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

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

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

The sum of its prime factors is 270954.

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

Adding to 200010111123 its reverse (321111010002), we get a palindrome (521121121125).

The spelling of 200010111123 in words is "two hundred billion, ten million, one hundred eleven thousand, one hundred twenty-three".

Divisors: 1 3 37 111 6823 20469 252451 264091 757353 792273 9771367 29314101 1801892893 5405678679 66670037041 200010111123