Base | Representation |
---|---|
bin | 111000111010001011… |
… | …0101111000000000101 |
3 | 102200110002221021001212 |
4 | 1301310112233000011 |
5 | 4000242031413104 |
6 | 132050522101205 |
7 | 11554336032431 |
oct | 1616426570005 |
9 | 380402837055 |
10 | 122211201029 |
11 | 47914045195 |
12 | 1b82834a805 |
13 | b6a833b148 |
14 | 5cb4c9b9c1 |
15 | 32a418636e |
hex | 1c745af005 |
122211201029 has 2 divisors, whose sum is σ = 122211201030. Its totient is φ = 122211201028.
The previous prime is 122211200983. The next prime is 122211201031. The reversal of 122211201029 is 920102112221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121891756900 + 319444129 = 349130^2 + 17873^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122211201029 is a prime.
Together with 122211201031, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 122211200995 and 122211201013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122211201089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61105600514 + 61105600515.
It is an arithmetic number, because the mean of its divisors is an integer number (61105600515).
Almost surely, 2122211201029 is an apocalyptic number.
It is an amenable number.
122211201029 is a deficient number, since it is larger than the sum of its proper divisors (1).
122211201029 is an equidigital number, since it uses as much as digits as its factorization.
122211201029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 122211201029 in words is "one hundred twenty-two billion, two hundred eleven million, two hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •