Base | Representation |
---|---|
bin | 11011010011110110010010… |
… | …101110100101111011000101 |
3 | 120202021112001120211010222011 |
4 | 123103312102232211323011 |
5 | 111220400240330321013 |
6 | 1103242200024534221 |
7 | 34204515024462106 |
oct | 3323662256457305 |
9 | 522245046733864 |
10 | 120111222120133 |
11 | 352a8979659262 |
12 | 1157a439321371 |
13 | 5203593b9448a |
14 | 21935b26a03ad |
15 | dd457dba7c3d |
hex | 6d3d92ba5ec5 |
120111222120133 has 2 divisors, whose sum is σ = 120111222120134. Its totient is φ = 120111222120132.
The previous prime is 120111222120049. The next prime is 120111222120143. The reversal of 120111222120133 is 331021222111021.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73995401835364 + 46115820284769 = 8602058^2 + 6790863^2 .
It is a cyclic number.
It is not a de Polignac number, because 120111222120133 - 225 = 120111188565701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120111222120143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60055611060066 + 60055611060067.
It is an arithmetic number, because the mean of its divisors is an integer number (60055611060067).
Almost surely, 2120111222120133 is an apocalyptic number.
It is an amenable number.
120111222120133 is a deficient number, since it is larger than the sum of its proper divisors (1).
120111222120133 is an equidigital number, since it uses as much as digits as its factorization.
120111222120133 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 22.
Adding to 120111222120133 its reverse (331021222111021), we get a palindrome (451132444231154).
The spelling of 120111222120133 in words is "one hundred twenty trillion, one hundred eleven billion, two hundred twenty-two million, one hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •