Base | Representation |
---|---|
bin | 110000000001011000010001… |
… | …001011011000111101110110 |
3 | 1000200210121201112002100101220 |
4 | 300001120101023120331312 |
5 | 210140304132030341042 |
6 | 2025104223215131210 |
7 | 62325524625435462 |
oct | 6001302113307566 |
9 | 1020717645070356 |
10 | 211201010012022 |
11 | 61327933175438 |
12 | 1b830206b13b06 |
13 | 90b0229036444 |
14 | 3a2227d4734a2 |
15 | 1963c526ca8ec |
hex | c016112d8f76 |
211201010012022 has 8 divisors (see below), whose sum is σ = 422402020024056. Its totient is φ = 70400336670672.
The previous prime is 211201010012017. The next prime is 211201010012033. The reversal of 211201010012022 is 220210010102112.
It is a sphenic number, since it is the product of 3 distinct primes.
211201010012022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 211201010011992 and 211201010012010.
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, 17600084167663 + ... + 17600084167674.
It is an arithmetic number, because the mean of its divisors is an integer number (52800252503007).
Almost surely, 2211201010012022 is an apocalyptic number.
211201010012022 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.
211201010012022 is a wasteful number, since it uses less digits than its factorization.
211201010012022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35200168335342.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211201010012022 its reverse (220210010102112), we get a palindrome (431411020114134).
The spelling of 211201010012022 in words is "two hundred eleven trillion, two hundred one billion, ten million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •