Base | Representation |
---|---|
bin | 110000001110101000110010… |
… | …111110011111010000100110 |
3 | 1000211000201102122200102222102 |
4 | 300032220302332133100212 |
5 | 210300221100142401042 |
6 | 2031042542544332102 |
7 | 62451410552542655 |
oct | 6016506276372046 |
9 | 1024021378612872 |
10 | 212112110122022 |
11 | 6164927145a160 |
12 | 1b9588b8614032 |
13 | 914811739b776 |
14 | 3a543d0b4919c |
15 | 197c7c946db32 |
hex | c0ea32f9f426 |
212112110122022 has 16 divisors (see below), whose sum is σ = 347117545599552. Its totient is φ = 96407650575720.
The previous prime is 212112110121991. The next prime is 212112110122057. The reversal of 212112110122022 is 220221011211212.
212112110122022 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 = 212112110121985 and 212112110122003.
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, 346934348 + ... + 347545199.
It is an arithmetic number, because the mean of its divisors is an integer number (21694846599972).
Almost surely, 2212112110122022 is an apocalyptic number.
212112110122022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
212112110122022 is a deficient number, since it is larger than the sum of its proper divisors (135005435477530).
212112110122022 is a wasteful number, since it uses less digits than its factorization.
212112110122022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 694493443.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 212112110122022 its reverse (220221011211212), we get a palindrome (432333121333234).
The spelling of 212112110122022 in words is "two hundred twelve trillion, one hundred twelve billion, one hundred ten million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •