Base | Representation |
---|---|
bin | 101101100001010100110101… |
… | …000001101101111010110010 |
3 | 222020212010212120000001022122 |
4 | 231201110311001231322302 |
5 | 202220103101223223442 |
6 | 1545443342053434242 |
7 | 60112063103620304 |
oct | 5541246501557262 |
9 | 866763776001278 |
10 | 200202200211122 |
11 | 5887730483874a |
12 | 1a55463b93b982 |
13 | 8792ca9384815 |
14 | 3761ba3dd9974 |
15 | 1822aba772dd2 |
hex | b6153506deb2 |
200202200211122 has 8 divisors (see below), whose sum is σ = 300303687534876. Its totient is φ = 100100971032832.
The previous prime is 200202200211113. The next prime is 200202200211133. The reversal of 200202200211122 is 221112002202002.
It is a happy number.
200202200211122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 157123993777921 + 43078206433201 = 12534911^2 + 6563399^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 200202200211122.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62585723 + ... + 65706750.
Almost surely, 2200202200211122 is an apocalyptic number.
200202200211122 is a deficient number, since it is larger than the sum of its proper divisors (100101487323754).
200202200211122 is a wasteful number, since it uses less digits than its factorization.
200202200211122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129072732.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 200202200211122 its reverse (221112002202002), we get a palindrome (421314202413124).
The spelling of 200202200211122 in words is "two hundred trillion, two hundred two billion, two hundred million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •