Base | Representation |
---|---|
bin | 110000001101001010101110… |
… | …011011111011001011011011 |
3 | 1000210200001201020111102110221 |
4 | 300031022232123323023123 |
5 | 210242042214132033034 |
6 | 2030524320014420511 |
7 | 62441203516545403 |
oct | 6015125633731333 |
9 | 1023601636442427 |
10 | 212011102221019 |
11 | 6160a4490a4122 |
12 | 1b941209201737 |
13 | 913b73ab167ca |
14 | 3a4d56bcc1803 |
15 | 1979d669e1bb4 |
hex | c0d2ae6fb2db |
212011102221019 has 4 divisors (see below), whose sum is σ = 212011163148744. Its totient is φ = 212011041293296.
The previous prime is 212011102220941. The next prime is 212011102221059. The reversal of 212011102221019 is 910122201110212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212011102221019 - 247 = 71273613865691 is a prime.
It is a super-2 number, since 2×2120111022210192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212011102220984 and 212011102221002.
It is not an unprimeable number, because it can be changed into a prime (212011102221059) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24906337 + ... + 32316370.
It is an arithmetic number, because the mean of its divisors is an integer number (53002790787186).
Almost surely, 2212011102221019 is an apocalyptic number.
212011102221019 is a deficient number, since it is larger than the sum of its proper divisors (60927725).
212011102221019 is an equidigital number, since it uses as much as digits as its factorization.
212011102221019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60927724.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 212011102221019 in words is "two hundred twelve trillion, eleven billion, one hundred two million, two hundred twenty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •