Base | Representation |
---|---|
bin | 101101011110100010110000… |
… | …101011011010100011100110 |
3 | 222020011212100120100111010202 |
4 | 231132202300223122203212 |
5 | 202203440012302223420 |
6 | 1545215441355350502 |
7 | 60062214031133345 |
oct | 5536426053324346 |
9 | 866155316314122 |
10 | 200011001211110 |
11 | 588032099a9061 |
12 | 1a52357b752432 |
13 | 877ac5851b85b |
14 | 3756826b2bb5c |
15 | 181cb29cbc575 |
hex | b5e8b0ada8e6 |
200011001211110 has 16 divisors (see below), whose sum is σ = 368800772965632. Its totient is φ = 78053073643200.
The previous prime is 200011001211083. The next prime is 200011001211127. The reversal of 200011001211110 is 11112100110002.
It is a junction number, because it is equal to n+sod(n) for n = 200011001211091 and 200011001211100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 243915854726 + ... + 243915855545.
It is an arithmetic number, because the mean of its divisors is an integer number (23050048310352).
Almost surely, 2200011001211110 is an apocalyptic number.
200011001211110 is a deficient number, since it is larger than the sum of its proper divisors (168789771754522).
200011001211110 is a wasteful number, since it uses less digits than its factorization.
200011001211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487831710319.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 200011001211110 its reverse (11112100110002), we get a palindrome (211123101321112).
The spelling of 200011001211110 in words is "two hundred trillion, eleven billion, one million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •