Base | Representation |
---|---|
bin | 111000110111001100… |
… | …0111001000000110111 |
3 | 102200012010120202102121 |
4 | 1301232120321000313 |
5 | 4000040420244111 |
6 | 132032544420411 |
7 | 11552012151511 |
oct | 1615630710067 |
9 | 380163522377 |
10 | 122111103031 |
11 | 47872597075 |
12 | 1b7ba917707 |
13 | b690691b68 |
14 | 5ca5882bb1 |
15 | 329a4b2871 |
hex | 1c6e639037 |
122111103031 has 2 divisors, whose sum is σ = 122111103032. Its totient is φ = 122111103030.
The previous prime is 122111103029. The next prime is 122111103091. The reversal of 122111103031 is 130301111221.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122111103031 - 21 = 122111103029 is a prime.
It is a super-2 number, since 2×1221111030312 (a number of 23 digits) contains 22 as substring.
Together with 122111103029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 122111102996 and 122111103014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122111103091) 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 as a sum of consecutive naturals, namely, 61055551515 + 61055551516.
It is an arithmetic number, because the mean of its divisors is an integer number (61055551516).
Almost surely, 2122111103031 is an apocalyptic number.
122111103031 is a deficient number, since it is larger than the sum of its proper divisors (1).
122111103031 is an equidigital number, since it uses as much as digits as its factorization.
122111103031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 122111103031 its reverse (130301111221), we get a palindrome (252412214252).
The spelling of 122111103031 in words is "one hundred twenty-two billion, one hundred eleven million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •