Base | Representation |
---|---|
bin | 101101100001010010110001… |
… | …111001000000001000001000 |
3 | 222020211221012020010101111002 |
4 | 231201102301321000020020 |
5 | 202220034100012023422 |
6 | 1545442335501554132 |
7 | 60111654430233461 |
oct | 5541226171001010 |
9 | 866757166111432 |
10 | 200200000111112 |
11 | 5887638594aa81 |
12 | 1a554126b75948 |
13 | 8792a186197b1 |
14 | 3761a35b33d68 |
15 | 18229dc536692 |
hex | b614b1e40208 |
200200000111112 has 32 divisors (see below), whose sum is σ = 376074260454720. Its totient is φ = 99913543329600.
The previous prime is 200200000111043. The next prime is 200200000111121. The reversal of 200200000111112 is 211111000002002.
200200000111112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200200000111093 and 200200000111102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128039237 + ... + 129593387.
It is an arithmetic number, because the mean of its divisors is an integer number (11752320639210).
Almost surely, 2200200000111112 is an apocalyptic number.
It is an amenable number.
200200000111112 is a deficient number, since it is larger than the sum of its proper divisors (175874260343608).
200200000111112 is a wasteful number, since it uses less digits than its factorization.
200200000111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1584141 (or 1584137 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200200000111112 its reverse (211111000002002), we get a palindrome (411311000113114).
The spelling of 200200000111112 in words is "two hundred trillion, two hundred billion, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •