Base | Representation |
---|---|
bin | 10001011110101000011… |
… | …101010001100101111111 |
3 | 11020211022021011211010122 |
4 | 101132220131101211333 |
5 | 124134344230401421 |
6 | 2315442103325155 |
7 | 152530632404042 |
oct | 21365035214577 |
9 | 4224267154118 |
10 | 1201122122111 |
11 | 42343614103a |
12 | 1749514507bb |
13 | 8935ac129a2 |
14 | 421c5584c59 |
15 | 2139d4912ab |
hex | 117a875197f |
1201122122111 has 16 divisors (see below), whose sum is σ = 1212198624000. Its totient is φ = 1190100867840.
The previous prime is 1201122122099. The next prime is 1201122122129. The reversal of 1201122122111 is 1112212211021.
It is a cyclic number.
It is not a de Polignac number, because 1201122122111 - 26 = 1201122122047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1201122122111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201122122141) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 208924265 + ... + 208930013.
It is an arithmetic number, because the mean of its divisors is an integer number (75762414000).
Almost surely, 21201122122111 is an apocalyptic number.
1201122122111 is a deficient number, since it is larger than the sum of its proper divisors (11076501889).
1201122122111 is a wasteful number, since it uses less digits than its factorization.
1201122122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10226.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1201122122111 its reverse (1112212211021), we get a palindrome (2313334333132).
The spelling of 1201122122111 in words is "one trillion, two hundred one billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •