Base | Representation |
---|---|
bin | 1100010110001011011… |
… | …1000100010001110111 |
3 | 202021111110011001010102 |
4 | 3011202313010101313 |
5 | 11433401133000434 |
6 | 241235400144315 |
7 | 21216222152465 |
oct | 3054267042167 |
9 | 667443131112 |
10 | 212112000119 |
11 | 81a57770158 |
12 | 35137a6809b |
13 | 17004739556 |
14 | a3a2935835 |
15 | 57b696a07e |
hex | 3162dc4477 |
212112000119 has 2 divisors, whose sum is σ = 212112000120. Its totient is φ = 212112000118.
The previous prime is 212112000091. The next prime is 212112000137. The reversal of 212112000119 is 911000211212.
212112000119 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212112000119 - 28 = 212111999863 is a prime.
It is a super-2 number, since 2×2121120001192 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 212112000119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212112000169) 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, 106056000059 + 106056000060.
It is an arithmetic number, because the mean of its divisors is an integer number (106056000060).
Almost surely, 2212112000119 is an apocalyptic number.
212112000119 is a deficient number, since it is larger than the sum of its proper divisors (1).
212112000119 is an equidigital number, since it uses as much as digits as its factorization.
212112000119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 212112000119 in words is "two hundred twelve billion, one hundred twelve million, one hundred nineteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •