Base | Representation |
---|---|
bin | 11110101111001001100… |
… | …010001000101000110101 |
3 | 21110220222112222002201012 |
4 | 132233021202020220311 |
5 | 234101301242023104 |
6 | 4254200321042005 |
7 | 305413351465634 |
oct | 36571142105065 |
9 | 7426875862635 |
10 | 2112210111029 |
11 | 7448685a7037 |
12 | 2a143aa86305 |
13 | 1242468c2b85 |
14 | 743353c351b |
15 | 39e2413cd6e |
hex | 1ebc9888a35 |
2112210111029 has 2 divisors, whose sum is σ = 2112210111030. Its totient is φ = 2112210111028.
The previous prime is 2112210111019. The next prime is 2112210111139. The reversal of 2112210111029 is 9201110122112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2053804272100 + 58405838929 = 1433110^2 + 241673^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2112210111029 is a prime.
It is a super-2 number, since 2×21122101110292 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2112210110995 and 2112210111013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2112210111019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056105055514 + 1056105055515.
It is an arithmetic number, because the mean of its divisors is an integer number (1056105055515).
Almost surely, 22112210111029 is an apocalyptic number.
It is an amenable number.
2112210111029 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112210111029 is an equidigital number, since it uses as much as digits as its factorization.
2112210111029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 2112210111029 in words is "two trillion, one hundred twelve billion, two hundred ten million, one hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •