Base | Representation |
---|---|
bin | 11001000011110001111111… |
… | …100100111111110001110011 |
3 | 112110020001212011120100122220 |
4 | 121003301333210333301303 |
5 | 103421144112303021321 |
6 | 1030222122432132123 |
7 | 32133324231351063 |
oct | 3103617744776163 |
9 | 473201764510586 |
10 | 110211001220211 |
11 | 3213124aaa2a21 |
12 | 1043b769397043 |
13 | 4965b11854498 |
14 | 1d3035312d3a3 |
15 | cb1c938b79c6 |
hex | 643c7f93fc73 |
110211001220211 has 32 divisors (see below), whose sum is σ = 150153590461440. Its totient is φ = 71883152762400.
The previous prime is 110211001220207. The next prime is 110211001220249. The reversal of 110211001220211 is 112022100112011.
It is a happy number.
It is not a de Polignac number, because 110211001220211 - 22 = 110211001220207 is a prime.
It is a super-2 number, since 2×1102110012202112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110211001220261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1068184656 + ... + 1068287826.
It is an arithmetic number, because the mean of its divisors is an integer number (4692299701920).
Almost surely, 2110211001220211 is an apocalyptic number.
110211001220211 is a deficient number, since it is larger than the sum of its proper divisors (39942589241229).
110211001220211 is a wasteful number, since it uses less digits than its factorization.
110211001220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132047.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110211001220211 its reverse (112022100112011), we get a palindrome (222233101332222).
The spelling of 110211001220211 in words is "one hundred ten trillion, two hundred eleven billion, one million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •