Base | Representation |
---|---|
bin | 1100010101110011101… |
… | …0010111010010100010 |
3 | 202021020111100201122021 |
4 | 3011130322113102202 |
5 | 11433200110413442 |
6 | 241221433132054 |
7 | 21213600655351 |
oct | 3053472272242 |
9 | 667214321567 |
10 | 212012201122 |
11 | 81a063a6747 |
12 | 3510a55a02a |
13 | 16cb9b663a7 |
14 | a393597998 |
15 | 57acd04e67 |
hex | 315ce974a2 |
212012201122 has 8 divisors (see below), whose sum is σ = 328276956672. Its totient is φ = 102586548900.
The previous prime is 212012201113. The next prime is 212012201129. The reversal of 212012201122 is 221102210212.
It is a happy number.
212012201122 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 212012201096 and 212012201105.
It is not an unprimeable number, because it can be changed into a prime (212012201129) 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 3 ways as a sum of consecutive naturals, for example, 1709775754 + ... + 1709775877.
It is an arithmetic number, because the mean of its divisors is an integer number (41034619584).
Almost surely, 2212012201122 is an apocalyptic number.
212012201122 is a deficient number, since it is larger than the sum of its proper divisors (116264755550).
212012201122 is a wasteful number, since it uses less digits than its factorization.
212012201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3419551664.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 212012201122 its reverse (221102210212), we get a palindrome (433114411334).
The spelling of 212012201122 in words is "two hundred twelve billion, twelve million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •