Base | Representation |
---|---|
bin | 100000000010110111111… |
… | …111011000101001100000 |
3 | 21210112000211122211101120 |
4 | 200002313333120221200 |
5 | 242034410141231422 |
6 | 4403345125532240 |
7 | 315045225012204 |
oct | 40026777305140 |
9 | 7715024584346 |
10 | 2202110102112 |
11 | 779a0081aa28 |
12 | 2b694a274080 |
13 | 12c872a9a57b |
14 | 78822ccab04 |
15 | 3c43681245c |
hex | 200b7fd8a60 |
2202110102112 has 96 divisors (see below), whose sum is σ = 5794202937600. Its totient is φ = 732303336960.
The previous prime is 2202110102107. The next prime is 2202110102123. The reversal of 2202110102112 is 2112010112022.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 2202110102091 and 2202110102100.
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, 88026118 + ... + 88051130.
It is an arithmetic number, because the mean of its divisors is an integer number (60356280600).
Almost surely, 22202110102112 is an apocalyptic number.
It is an amenable number.
2202110102112 is an abundant number, since it is smaller than the sum of its proper divisors (3592092835488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2202110102112 is a wasteful number, since it uses less digits than its factorization.
2202110102112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27156 (or 27148 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2202110102112 its reverse (2112010112022), we get a palindrome (4314120214134).
The spelling of 2202110102112 in words is "two trillion, two hundred two billion, one hundred ten million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •