Base | Representation |
---|---|
bin | 100000001100001100101… |
… | …000001001110110000000 |
3 | 21211110212110001211201220 |
4 | 200030030220021312000 |
5 | 242220410210310422 |
6 | 4412122304555040 |
7 | 315551252561355 |
oct | 40141450116600 |
9 | 7743773054656 |
10 | 2212120010112 |
11 | 783178091a71 |
12 | 2b8882622a80 |
13 | 1307a984675c |
14 | 790d24ac62c |
15 | 3c8204cae5c |
hex | 2030ca09d80 |
2212120010112 has 64 divisors (see below), whose sum is σ = 5879695180800. Its totient is φ = 736902572544.
The previous prime is 2212120010081. The next prime is 2212120010159. The reversal of 2212120010112 is 2110100212122.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 2212120010091 and 2212120010100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1236412 + ... + 2439867.
It is an arithmetic number, because the mean of its divisors is an integer number (91870237200).
Almost surely, 22212120010112 is an apocalyptic number.
It is an amenable number.
2212120010112 is an abundant number, since it is smaller than the sum of its proper divisors (3667575170688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2212120010112 is a wasteful number, since it uses less digits than its factorization.
2212120010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3677863 (or 3677851 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2212120010112 its reverse (2110100212122), we get a palindrome (4322220222234).
The spelling of 2212120010112 in words is "two trillion, two hundred twelve billion, one hundred twenty million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •