Base | Representation |
---|---|
bin | 1100010110010010100… |
… | …1111110000000111011 |
3 | 202021120112211100020022 |
4 | 3011210221332000323 |
5 | 11433431340333034 |
6 | 241242353521055 |
7 | 21220036163513 |
oct | 3054451760073 |
9 | 667515740208 |
10 | 212142121019 |
11 | 81a72773464 |
12 | 35145b7318b |
13 | 1700aa5457a |
14 | a3a6936843 |
15 | 57b9419b2e |
hex | 3164a7e03b |
212142121019 has 8 divisors (see below), whose sum is σ = 214113353520. Its totient is φ = 210171342816.
The previous prime is 212142120961. The next prime is 212142121021. The reversal of 212142121019 is 910121241212.
212142121019 is digitally balanced in base 2, because in such base 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 cyclic number.
It is not a de Polignac number, because 212142121019 - 216 = 212142055483 is a prime.
It is a super-2 number, since 2×2121421210192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212142121319) 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 7 ways as a sum of consecutive naturals, for example, 863549 + ... + 1081665.
It is an arithmetic number, because the mean of its divisors is an integer number (26764169190).
Almost surely, 2212142121019 is an apocalyptic number.
212142121019 is a deficient number, since it is larger than the sum of its proper divisors (1971232501).
212142121019 is a wasteful number, since it uses less digits than its factorization.
212142121019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227149.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 212142121019 in words is "two hundred twelve billion, one hundred forty-two million, one hundred twenty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •