Base | Representation |
---|---|
bin | 100000001010011010001… |
… | …100010111001010011100 |
3 | 21211021220122110102101020 |
4 | 200022122030113022130 |
5 | 242202442212401022 |
6 | 4411204003044140 |
7 | 315452551030101 |
oct | 40123214271234 |
9 | 7737818412336 |
10 | 2210200122012 |
11 | 782382392693 |
12 | 2b8427670650 |
13 | 130561b6b6ac |
14 | 78d8d508aa8 |
15 | 3c75bb9035c |
hex | 2029a31729c |
2210200122012 has 12 divisors (see below), whose sum is σ = 5157133618056. Its totient is φ = 736733374000.
The previous prime is 2210200122007. The next prime is 2210200122043. The reversal of 2210200122012 is 2102210020122.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 2210200121982 and 2210200122000.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 92091671739 + ... + 92091671762.
It is an arithmetic number, because the mean of its divisors is an integer number (429761134838).
Almost surely, 22210200122012 is an apocalyptic number.
It is an amenable number.
2210200122012 is an abundant number, since it is smaller than the sum of its proper divisors (2946933496044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2210200122012 is a wasteful number, since it uses less digits than its factorization.
2210200122012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184183343508 (or 184183343506 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2210200122012 its reverse (2102210020122), we get a palindrome (4312410142134).
The spelling of 2210200122012 in words is "two trillion, two hundred ten billion, two hundred million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •