Base | Representation |
---|---|
bin | 1100010110100000011… |
… | …1100110010111011001 |
3 | 202021201121011002012220 |
4 | 3011220013212113121 |
5 | 11434041224020441 |
6 | 241252231054253 |
7 | 21221343052611 |
oct | 3055007462731 |
9 | 667647132186 |
10 | 212200220121 |
11 | 81aa254614a |
12 | 35161511389 |
13 | 17019ab7236 |
14 | a3b053ba41 |
15 | 57be594466 |
hex | 31681e65d9 |
212200220121 has 32 divisors (see below), whose sum is σ = 306777538560. Its totient is φ = 130083624000.
The previous prime is 212200220093. The next prime is 212200220129. The reversal of 212200220121 is 121022002212.
212200220121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 212200220121 - 27 = 212200219993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 212200220121.
It is not an unprimeable number, because it can be changed into a prime (212200220129) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 5506 + ... + 651483.
It is an arithmetic number, because the mean of its divisors is an integer number (9586798080).
Almost surely, 2212200220121 is an apocalyptic number.
It is an amenable number.
212200220121 is a deficient number, since it is larger than the sum of its proper divisors (94577318439).
212200220121 is a wasteful number, since it uses less digits than its factorization.
212200220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 657197.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 212200220121 its reverse (121022002212), we get a palindrome (333222222333).
The spelling of 212200220121 in words is "two hundred twelve billion, two hundred million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •