Base | Representation |
---|---|
bin | 1011110000111011000… |
… | …1000111110100010100 |
3 | 201022200110220211021020 |
4 | 2330032301013310110 |
5 | 11302410433033022 |
6 | 232503144521140 |
7 | 20413335014211 |
oct | 2741661076424 |
9 | 638613824236 |
10 | 202111221012 |
11 | 78795573858 |
12 | 332067801b0 |
13 | 1609c83858c |
14 | 9ad464cb08 |
15 | 53cd9a635c |
hex | 2f0ec47d14 |
202111221012 has 48 divisors (see below), whose sum is σ = 478492987392. Its totient is φ = 66391268320.
The previous prime is 202111220953. The next prime is 202111221031. The reversal of 202111221012 is 210122111202.
202111221012 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 = 202111220982 and 202111221000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 166818 + ... + 657305.
It is an arithmetic number, because the mean of its divisors is an integer number (9968603904).
Almost surely, 2202111221012 is an apocalyptic number.
It is an amenable number.
202111221012 is an abundant number, since it is smaller than the sum of its proper divisors (276381766380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202111221012 is a wasteful number, since it uses less digits than its factorization.
202111221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 824428 (or 824426 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 202111221012 its reverse (210122111202), we get a palindrome (412233332214).
The spelling of 202111221012 in words is "two hundred two billion, one hundred eleven million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •