Base | Representation |
---|---|
bin | 11001000011111011011010… |
… | …110001010100110010000110 |
3 | 112110021000222102221012002011 |
4 | 121003323122301110302012 |
5 | 103421330324001110342 |
6 | 1030230514540404434 |
7 | 32134133063130250 |
oct | 3103733261246206 |
9 | 473230872835064 |
10 | 110221121113222 |
11 | 32135573456369 |
12 | 1044171254671a |
13 | 4966a6532bc62 |
14 | 1d30a33180cd0 |
15 | cb2187059717 |
hex | 643edac54c86 |
110221121113222 has 64 divisors (see below), whose sum is σ = 206308683947520. Its totient is φ = 43111924579584.
The previous prime is 110221121113171. The next prime is 110221121113307. The reversal of 110221121113222 is 222311121122011.
110221121113222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 110221121113193 and 110221121113202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65167753 + ... + 66837700.
It is an arithmetic number, because the mean of its divisors is an integer number (3223573186680).
Almost surely, 2110221121113222 is an apocalyptic number.
110221121113222 is a deficient number, since it is larger than the sum of its proper divisors (96087562834298).
110221121113222 is a wasteful number, since it uses less digits than its factorization.
110221121113222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132005597.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 110221121113222 its reverse (222311121122011), we get a palindrome (332532242235233).
The spelling of 110221121113222 in words is "one hundred ten trillion, two hundred twenty-one billion, one hundred twenty-one million, one hundred thirteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •