Base | Representation |
---|---|
bin | 11001000001000010000101… |
… | …011001001010110110100000 |
3 | 112102120000022201122111022201 |
4 | 121001002011121022312200 |
5 | 103410100300234101422 |
6 | 1025555244140542544 |
7 | 32113556463353200 |
oct | 3101020531126640 |
9 | 472500281574281 |
10 | 110022120222112 |
11 | 3206913465a49a |
12 | 1040b035551a54 |
13 | 495106ccc7497 |
14 | 1d25155a58400 |
15 | cabddb68c727 |
hex | 64108564ada0 |
110022120222112 has 72 divisors (see below), whose sum is σ = 255519179868960. Its totient is φ = 46488219765120.
The previous prime is 110022120222101. The next prime is 110022120222149. The reversal of 110022120222112 is 211222021220011.
It is a self number, because there is not a number n which added to its sum of digits gives 110022120222112.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 494023662 + ... + 494246317.
It is an arithmetic number, because the mean of its divisors is an integer number (3548877498180).
Almost surely, 2110022120222112 is an apocalyptic number.
It is an amenable number.
110022120222112 is an abundant number, since it is smaller than the sum of its proper divisors (145497059646848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110022120222112 is an equidigital number, since it uses as much as digits as its factorization.
110022120222112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 988270074 (or 988270059 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 110022120222112 its reverse (211222021220011), we get a palindrome (321244141442123).
The spelling of 110022120222112 in words is "one hundred ten trillion, twenty-two billion, one hundred twenty million, two hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •