Base | Representation |
---|---|
bin | 1001001101001100001101… |
… | …0101101110010010010111 |
3 | 1022211200012221002202200121 |
4 | 2103103003111232102113 |
5 | 2311320301332413421 |
6 | 33310030032052411 |
7 | 2063210024043244 |
oct | 223230325562227 |
9 | 38750187082617 |
10 | 10122220201111 |
11 | 325289a466097 |
12 | 1175907094107 |
13 | 5856a12c8055 |
14 | 26dcbd2905cb |
15 | 12847eca5d41 |
hex | 934c356e497 |
10122220201111 has 2 divisors, whose sum is σ = 10122220201112. Its totient is φ = 10122220201110.
The previous prime is 10122220201057. The next prime is 10122220201117. The reversal of 10122220201111 is 11110202222101.
10122220201111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10122220201111 - 215 = 10122220168343 is a prime.
It is a super-2 number, since 2×101222202011112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10122220201117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061110100555 + 5061110100556.
It is an arithmetic number, because the mean of its divisors is an integer number (5061110100556).
Almost surely, 210122220201111 is an apocalyptic number.
10122220201111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122220201111 is an equidigital number, since it uses as much as digits as its factorization.
10122220201111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10122220201111 its reverse (11110202222101), we get a palindrome (21232422423212).
The spelling of 10122220201111 in words is "ten trillion, one hundred twenty-two billion, two hundred twenty million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •