Base | Representation |
---|---|
bin | 101101011110101011001010… |
… | …010111000010010101001100 |
3 | 222020012201122020120121112020 |
4 | 231132223022113002111030 |
5 | 202204112001113324322 |
6 | 1545223532442410140 |
7 | 60062653415515164 |
oct | 5536531227022514 |
9 | 866181566517466 |
10 | 200020022011212 |
11 | 58807018a06757 |
12 | 1a525278800950 |
13 | 877ba653a24b0 |
14 | 3757040bd95a4 |
15 | 181cea6c0705c |
hex | b5eaca5c254c |
200020022011212 has 48 divisors (see below), whose sum is σ = 505245903439872. Its totient is φ = 61222398995520.
The previous prime is 200020022011169. The next prime is 200020022011247. The reversal of 200020022011212 is 212110220020002.
200020022011212 is digitally balanced in base 2, 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 = 200020022011191 and 200020022011200.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3356461378 + ... + 3356520969.
It is an arithmetic number, because the mean of its divisors is an integer number (10525956321664).
Almost surely, 2200020022011212 is an apocalyptic number.
It is an amenable number.
200020022011212 is an abundant number, since it is smaller than the sum of its proper divisors (305225881428660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200020022011212 is a wasteful number, since it uses less digits than its factorization.
200020022011212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6712982558 (or 6712982556 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200020022011212 its reverse (212110220020002), we get a palindrome (412130242031214).
The spelling of 200020022011212 in words is "two hundred trillion, twenty billion, twenty-two million, eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •