Base | Representation |
---|---|
bin | 1100111000000010001… |
… | …1011111100011010110 |
3 | 210010221211001100220212 |
4 | 3032000203133203112 |
5 | 12111004212320042 |
6 | 245341250125422 |
7 | 21660354666050 |
oct | 3160043374326 |
9 | 703854040825 |
10 | 221200120022 |
11 | 858a0779152 |
12 | 36a53580872 |
13 | 17b22530aab |
14 | a9c59288d0 |
15 | 5b49751482 |
hex | 33808df8d6 |
221200120022 has 16 divisors (see below), whose sum is σ = 401506100640. Its totient is φ = 89223577728.
The previous prime is 221200119997. The next prime is 221200120027. The reversal of 221200120022 is 220021002122.
221200120022 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 221200119979 and 221200120006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221200120027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 464705897 + ... + 464706372.
It is an arithmetic number, because the mean of its divisors is an integer number (25094131290).
Almost surely, 2221200120022 is an apocalyptic number.
221200120022 is a deficient number, since it is larger than the sum of its proper divisors (180305980618).
221200120022 is a wasteful number, since it uses less digits than its factorization.
221200120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929412295.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 221200120022 its reverse (220021002122), we get a palindrome (441221122144).
The spelling of 221200120022 in words is "two hundred twenty-one billion, two hundred million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •