Base | Representation |
---|---|
bin | 110000001101001010101110… |
… | …010011011101001011111011 |
3 | 1000210200001201002022122012201 |
4 | 300031022232103131023323 |
5 | 210242042213100013034 |
6 | 2030524315455051031 |
7 | 62441203461641164 |
oct | 6015125623351373 |
9 | 1023601632278181 |
10 | 212011100001019 |
11 | 6160a447918210 |
12 | 1b941208510a77 |
13 | 913b73a51a1b7 |
14 | 3a4d56b8a476b |
15 | 1979d66704014 |
hex | c0d2ae4dd2fb |
212011100001019 has 8 divisors (see below), whose sum is σ = 231296509990512. Its totient is φ = 192727635615840.
The previous prime is 212011100001011. The next prime is 212011100001023. The reversal of 212011100001019 is 910100001110212.
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 212011100001019 - 23 = 212011100001011 is a prime.
It is a super-2 number, since 2×2120111000010192 (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 = 212011100000987 and 212011100001005.
It is not an unprimeable number, because it can be changed into a prime (212011100001011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 486173224 + ... + 486609109.
It is an arithmetic number, because the mean of its divisors is an integer number (28912063748814).
Almost surely, 2212011100001019 is an apocalyptic number.
212011100001019 is a deficient number, since it is larger than the sum of its proper divisors (19285409989493).
212011100001019 is a wasteful number, since it uses less digits than its factorization.
212011100001019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 972802157.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 212011100001019 in words is "two hundred twelve trillion, eleven billion, one hundred million, one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •