Base | Representation |
---|---|
bin | 111000110100001111… |
… | …1010011100000010111 |
3 | 102122221020022221202120 |
4 | 1301220133103200113 |
5 | 3444340100333421 |
6 | 132015051111023 |
7 | 11546400626466 |
oct | 1615037234027 |
9 | 378836287676 |
10 | 122012121111 |
11 | 47821730531 |
12 | 1b791742473 |
13 | b67601688a |
14 | 5c966789dd |
15 | 329195e8c6 |
hex | 1c687d3817 |
122012121111 has 4 divisors (see below), whose sum is σ = 162682828152. Its totient is φ = 81341414072.
The previous prime is 122012121053. The next prime is 122012121151. The reversal of 122012121111 is 111121210221.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 122012121111 - 215 = 122012088343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122012121151) 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 3 ways as a sum of consecutive naturals, for example, 20335353516 + ... + 20335353521.
It is an arithmetic number, because the mean of its divisors is an integer number (40670707038).
Almost surely, 2122012121111 is an apocalyptic number.
122012121111 is a deficient number, since it is larger than the sum of its proper divisors (40670707041).
122012121111 is an equidigital number, since it uses as much as digits as its factorization.
122012121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40670707040.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122012121111 its reverse (111121210221), we get a palindrome (233133331332).
It can be divided in two parts, 12201 and 2121111, that added together give a palindrome (2133312).
The spelling of 122012121111 in words is "one hundred twenty-two billion, twelve million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •