Base | Representation |
---|---|
bin | 1100010010000111100… |
… | …1011101111000001110 |
3 | 202011200111022220020221 |
4 | 3010201321131320032 |
5 | 11424133130011342 |
6 | 240535304101554 |
7 | 21150216225100 |
oct | 3044171357016 |
9 | 664614286227 |
10 | 211022110222 |
11 | 81548530800 |
12 | 34a92a648ba |
13 | 16b8c9b85a1 |
14 | a2dbca9570 |
15 | 5750e2ea67 |
hex | 3121e5de0e |
211022110222 has 72 divisors (see below), whose sum is σ = 404944027488. Its totient is φ = 82172724480.
The previous prime is 211022110171. The next prime is 211022110331. The reversal of 211022110222 is 222011220112.
It is a happy number.
211022110222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 211022110196 and 211022110205.
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 35 ways as a sum of consecutive naturals, for example, 30744363 + ... + 30751225.
It is an arithmetic number, because the mean of its divisors is an integer number (5624222604).
Almost surely, 2211022110222 is an apocalyptic number.
211022110222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
211022110222 is a deficient number, since it is larger than the sum of its proper divisors (193921917266).
211022110222 is a wasteful number, since it uses less digits than its factorization.
211022110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9494 (or 9476 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 211022110222 its reverse (222011220112), we get a palindrome (433033330334).
The spelling of 211022110222 in words is "two hundred eleven billion, twenty-two million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •