Base | Representation |
---|---|
bin | 1011110000100101110… |
… | …1001100001100111100 |
3 | 201022110021020111221211 |
4 | 2330021131030030330 |
5 | 11302220130010022 |
6 | 232450242534204 |
7 | 20411203413322 |
oct | 2741135141474 |
9 | 638407214854 |
10 | 202022110012 |
11 | 7874a23a3a8 |
12 | 331a0967364 |
13 | 16087238188 |
14 | 9ac6893d12 |
15 | 53c5c52e77 |
hex | 2f0974c33c |
202022110012 has 24 divisors (see below), whose sum is σ = 355650520176. Its totient is φ = 100408501248.
The previous prime is 202022110007. The next prime is 202022110051. The reversal of 202022110012 is 210011220202.
It is a happy number.
202022110012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×2020221100123 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202022109974 and 202022110001.
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 7 ways as a sum of consecutive naturals, for example, 883383 + ... + 1088305.
It is an arithmetic number, because the mean of its divisors is an integer number (14818771674).
Almost surely, 2202022110012 is an apocalyptic number.
It is an amenable number.
202022110012 is a deficient number, since it is larger than the sum of its proper divisors (153628410164).
202022110012 is a wasteful number, since it uses less digits than its factorization.
202022110012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206397 (or 206395 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 202022110012 its reverse (210011220202), we get a palindrome (412033330214).
The spelling of 202022110012 in words is "two hundred two billion, twenty-two million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •