Base | Representation |
---|---|
bin | 110000001110111101011110… |
… | …110110101001010011110110 |
3 | 1000211002211202120120000212020 |
4 | 300032331132312221103312 |
5 | 210301102042200200042 |
6 | 2031101054534534010 |
7 | 62453125143000606 |
oct | 6016753666512366 |
9 | 1024084676500766 |
10 | 212134321100022 |
11 | 61657729a26722 |
12 | 1b961076b07306 |
13 | 914a246b4c7b9 |
14 | 3a554da928c06 |
15 | 197d1793743ec |
hex | c0ef5eda94f6 |
212134321100022 has 8 divisors (see below), whose sum is σ = 424268642200056. Its totient is φ = 70711440366672.
The previous prime is 212134321100003. The next prime is 212134321100059. The reversal of 212134321100022 is 220001123431212.
It is a sphenic number, since it is the product of 3 distinct primes.
212134321100022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 212134321099965 and 212134321100001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17677860091663 + ... + 17677860091674.
It is an arithmetic number, because the mean of its divisors is an integer number (53033580275007).
Almost surely, 2212134321100022 is an apocalyptic number.
212134321100022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212134321100022 is a wasteful number, since it uses less digits than its factorization.
212134321100022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35355720183342.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 212134321100022 its reverse (220001123431212), we get a palindrome (432135444531234).
The spelling of 212134321100022 in words is "two hundred twelve trillion, one hundred thirty-four billion, three hundred twenty-one million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •