Base | Representation |
---|---|
bin | 110000000001011000010001… |
… | …010011110100100001000110 |
3 | 1000200210121201200020121221202 |
4 | 300001120101103310201012 |
5 | 210140304133112101042 |
6 | 2025104223334342502 |
7 | 62325524653301564 |
oct | 6001302123644106 |
9 | 1020717650217852 |
10 | 211201012222022 |
11 | 61327934444889 |
12 | 1b8302077baa32 |
13 | 90b022962b334 |
14 | 3a2227d88aa34 |
15 | 1963c529b5632 |
hex | c016114f4846 |
211201012222022 has 8 divisors (see below), whose sum is σ = 316869750420696. Its totient is φ = 105577762081792.
The previous prime is 211201012222021. The next prime is 211201012222027. The reversal of 211201012222022 is 220222210102112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 211201012221985 and 211201012222003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211201012222021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11372003003 + ... + 11372021574.
It is an arithmetic number, because the mean of its divisors is an integer number (39608718802587).
Almost surely, 2211201012222022 is an apocalyptic number.
211201012222022 is a deficient number, since it is larger than the sum of its proper divisors (105668738198674).
211201012222022 is a wasteful number, since it uses less digits than its factorization.
211201012222022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22744029222.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 211201012222022 its reverse (220222210102112), we get a palindrome (431423222324134).
The spelling of 211201012222022 in words is "two hundred eleven trillion, two hundred one billion, twelve million, two hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •