Base | Representation |
---|---|
bin | 1001010010010111011001… |
… | …0100000000110001001111 |
3 | 1100011011200122221021000222 |
4 | 2110211312110000301033 |
5 | 2314244334242020421 |
6 | 33414531430541555 |
7 | 2102505061533101 |
oct | 224456624006117 |
9 | 40134618837028 |
10 | 10211122220111 |
11 | 328757032086a |
12 | 118ab982078bb |
13 | 590b9b7c5617 |
14 | 274314417571 |
15 | 12a934a49cab |
hex | 94976500c4f |
10211122220111 has 32 divisors (see below), whose sum is σ = 11426187386880. Its totient is φ = 9081070812000.
The previous prime is 10211122220107. The next prime is 10211122220153. The reversal of 10211122220111 is 11102222111201.
It is a cyclic number.
It is not a de Polignac number, because 10211122220111 - 22 = 10211122220107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10211122220111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211122220911) 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 31 ways as a sum of consecutive naturals, for example, 4544726 + ... + 6409116.
It is an arithmetic number, because the mean of its divisors is an integer number (357068355840).
Almost surely, 210211122220111 is an apocalyptic number.
10211122220111 is a deficient number, since it is larger than the sum of its proper divisors (1215065166769).
10211122220111 is a wasteful number, since it uses less digits than its factorization.
10211122220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1864667.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10211122220111 its reverse (11102222111201), we get a palindrome (21313344331312).
The spelling of 10211122220111 in words is "ten trillion, two hundred eleven billion, one hundred twenty-two million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •