Base | Representation |
---|---|
bin | 11011110000111100110110… |
… | …000011101010000110010111 |
3 | 121000100201011001111112001202 |
4 | 123300330312003222012113 |
5 | 112001132034230333421 |
6 | 1111413024114343115 |
7 | 34502144304140624 |
oct | 3360746603520627 |
9 | 530321131445052 |
10 | 122111122121111 |
11 | 359aa044009322 |
12 | 11841b5388aa9b |
13 | 531a04c7b5616 |
14 | 22222d1b5d34b |
15 | e1b5cced110b |
hex | 6f0f360ea197 |
122111122121111 has 16 divisors (see below), whose sum is σ = 134137979385600. Its totient is φ = 110645111446848.
The previous prime is 122111122121069. The next prime is 122111122121113. The reversal of 122111122121111 is 111121221111221.
It is a cyclic number.
It is not a de Polignac number, because 122111122121111 - 210 = 122111122120087 is a prime.
It is a super-2 number, since 2×1221111221211112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122111122121113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6644846 + ... + 16981643.
It is an arithmetic number, because the mean of its divisors is an integer number (8383623711600).
Almost surely, 2122111122121111 is an apocalyptic number.
122111122121111 is a deficient number, since it is larger than the sum of its proper divisors (12026857264489).
122111122121111 is a wasteful number, since it uses less digits than its factorization.
122111122121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23638358.
The product of its digits is 32, while the sum is 20.
Adding to 122111122121111 its reverse (111121221111221), we get a palindrome (233232343232332).
The spelling of 122111122121111 in words is "one hundred twenty-two trillion, one hundred eleven billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •