Base | Representation |
---|---|
bin | 101101111110101110000110… |
… | …100001011100100000001100 |
3 | 222112000020211221221202001210 |
4 | 231332232012201130200030 |
5 | 203001202032220041022 |
6 | 1554031332552534420 |
7 | 60411033453520245 |
oct | 5576560641344014 |
9 | 875006757852053 |
10 | 202222202112012 |
11 | 59485a55196735 |
12 | 1a8200263b1410 |
13 | 88ab61980aab4 |
14 | 37d186d107ccc |
15 | 185a3e4744a0c |
hex | b7eb8685c80c |
202222202112012 has 48 divisors (see below), whose sum is σ = 492368635325952. Its totient is φ = 64476443201280.
The previous prime is 202222202111981. The next prime is 202222202112031. The reversal of 202222202112012 is 210211202222202.
It is a self number, because there is not a number n which added to its sum of digits gives 202222202112012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105631753 + ... + 107529119.
It is an arithmetic number, because the mean of its divisors is an integer number (10257679902624).
Almost surely, 2202222202112012 is an apocalyptic number.
It is an amenable number.
202222202112012 is an abundant number, since it is smaller than the sum of its proper divisors (290146433213940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202222202112012 is a wasteful number, since it uses less digits than its factorization.
202222202112012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2283558 (or 2283556 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 202222202112012 its reverse (210211202222202), we get a palindrome (412433404334214).
The spelling of 202222202112012 in words is "two hundred two trillion, two hundred twenty-two billion, two hundred two million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •