Base | Representation |
---|---|
bin | 110000000001101011111010… |
… | …110110010010111101000110 |
3 | 1000200212122012000211222102001 |
4 | 300001223322312102331012 |
5 | 210141130340204020402 |
6 | 2025122033045535514 |
7 | 62330202540313222 |
oct | 6001537266227506 |
9 | 1020778160758361 |
10 | 211222110220102 |
11 | 61335880741033 |
12 | 1b83431541459a |
13 | 90b220c635677 |
14 | 3a232c190d782 |
15 | 1964589d1e187 |
hex | c01afad92f46 |
211222110220102 has 16 divisors (see below), whose sum is σ = 317600326209600. Its totient is φ = 105355352271400.
The previous prime is 211222110220097. The next prime is 211222110220123. The reversal of 211222110220102 is 201022011222112.
211222110220102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2112221102201022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211222110220102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19935477 + ... + 28633327.
It is an arithmetic number, because the mean of its divisors is an integer number (19850020388100).
Almost surely, 2211222110220102 is an apocalyptic number.
211222110220102 is a deficient number, since it is larger than the sum of its proper divisors (106378215989498).
211222110220102 is a wasteful number, since it uses less digits than its factorization.
211222110220102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8727251.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 211222110220102 its reverse (201022011222112), we get a palindrome (412244121442214).
The spelling of 211222110220102 in words is "two hundred eleven trillion, two hundred twenty-two billion, one hundred ten million, two hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •