Base | Representation |
---|---|
bin | 110010000100100000100001… |
… | …010100000010010111011100 |
3 | 1001212201001222102020210110010 |
4 | 302010200201110002113130 |
5 | 212330423411224214322 |
6 | 2100204015144243220 |
7 | 64245541446422403 |
oct | 6204404124022734 |
9 | 1055631872223403 |
10 | 220212122101212 |
11 | 6419148900a64a |
12 | 20846702170510 |
13 | 95b4bb6107a27 |
14 | 3c54475c8663a |
15 | 1a6d3516d820c |
hex | c848215025dc |
220212122101212 has 12 divisors (see below), whose sum is σ = 513828284902856. Its totient is φ = 73404040700400.
The previous prime is 220212122101201. The next prime is 220212122101217. The reversal of 220212122101212 is 212101221212022.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220212122101217) by changing a digit.
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, 9175505087539 + ... + 9175505087562.
Almost surely, 2220212122101212 is an apocalyptic number.
It is an amenable number.
220212122101212 is an abundant number, since it is smaller than the sum of its proper divisors (293616162801644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220212122101212 is a wasteful number, since it uses less digits than its factorization.
220212122101212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18351010175108 (or 18351010175106 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 220212122101212 its reverse (212101221212022), we get a palindrome (432313343313234).
The spelling of 220212122101212 in words is "two hundred twenty trillion, two hundred twelve billion, one hundred twenty-two million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •