Base | Representation |
---|---|
bin | 1100010110001101011… |
… | …0000011001101101110 |
3 | 202021112000102200120001 |
4 | 3011203112003031232 |
5 | 11433410222402342 |
6 | 241240250214514 |
7 | 21216351201211 |
oct | 3054326031556 |
9 | 667460380501 |
10 | 212120122222 |
11 | 81a61308438 |
12 | 3513a72443a |
13 | 17006321428 |
14 | a3a3a4b778 |
15 | 57b75218b7 |
hex | 316358336e |
212120122222 has 4 divisors (see below), whose sum is σ = 318180183336. Its totient is φ = 106060061110.
The previous prime is 212120122189. The next prime is 212120122229. The reversal of 212120122222 is 222221021212.
212120122222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a self number, because there is not a number n which added to its sum of digits gives 212120122222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212120122229) 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 as a sum of consecutive naturals, namely, 53030030554 + ... + 53030030557.
It is an arithmetic number, because the mean of its divisors is an integer number (79545045834).
Almost surely, 2212120122222 is an apocalyptic number.
212120122222 is a deficient number, since it is larger than the sum of its proper divisors (106060061114).
212120122222 is a wasteful number, since it uses less digits than its factorization.
212120122222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106060061113.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 212120122222 its reverse (222221021212), we get a palindrome (434341143434).
The spelling of 212120122222 in words is "two hundred twelve billion, one hundred twenty million, one hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •